Parametric Linear Dynamic Logic
Directory of Open Access Journals (Sweden)
Peter Faymonville
2014-08-01
Full Text Available We introduce Parametric Linear Dynamic Logic (PLDL, which extends Linear Dynamic Logic (LDL by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL that is able to express all ω-regular specifications while still maintaining many of LTL's desirable properties like an intuitive syntax and a translation into non-deterministic Büchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all ω-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our main technical contribution is a translation of PLDL formulas into non-deterministic Büchi word automata of exponential size via alternating automata. This yields a PSPACE model checking algorithm and a realizability algorithm with doubly-exponential running time. Furthermore, we give tight upper and lower bounds on optimal parameter values for both problems. These results show that PLDL model checking and realizability are not harder than LTL model checking and realizability.
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
This article shows how individual Petri nets form models of Girard's intuitionistic linear logic. It explores questions of expressiveness and completeness of linear logic with respect to this interpretation. An aim is to use Petri nets to give an understanding of linear logic and give some apprai...
Application of linear logic to simulation
Clarke, Thomas L.
1998-08-01
Linear logic, since its introduction by Girard in 1987 has proven expressive and powerful. Linear logic has provided natural encodings of Turing machines, Petri nets and other computational models. Linear logic is also capable of naturally modeling resource dependent aspects of reasoning. The distinguishing characteristic of linear logic is that it accounts for resources; two instances of the same variable are considered differently from a single instance. Linear logic thus must obey a form of the linear superposition principle. A proportion can be reasoned with only once, unless a special operator is applied. Informally, linear logic distinguishes two kinds of conjunction, two kinds of disjunction, and also introduces a modal storage operator that explicitly indicates propositions that can be reused. This paper discuses the application of linear logic to simulation. A wide variety of logics have been developed; in addition to classical logic, there are fuzzy logics, affine logics, quantum logics, etc. All of these have found application in simulations of one sort or another. The special characteristics of linear logic and its benefits for simulation will be discussed. Of particular interest is a connection that can be made between linear logic and simulated dynamics by using the concept of Lie algebras and Lie groups. Lie groups provide the connection between the exponential modal storage operators of linear logic and the eigen functions of dynamic differential operators. Particularly suggestive are possible relations between complexity result for linear logic and non-computability results for dynamical systems.
Petri Nets as Models of Linear Logic
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
1990-01-01
The chief purpose of this paper is to appraise the feasibility of Girad's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear logic in Petri nets, with respect to which we investigate the expressive power of the logic...
Relating Reasoning Methodologies in Linear Logic and Process Algebra
Directory of Open Access Journals (Sweden)
Yuxin Deng
2012-11-01
Full Text Available We show that the proof-theoretic notion of logical preorder coincides with the process-theoretic notion of contextual preorder for a CCS-like calculus obtained from the formula-as-process interpretation of a fragment of linear logic. The argument makes use of other standard notions in process algebra, namely a labeled transition system and a coinductively defined simulation relation. This result establishes a connection between an approach to reason about process specifications and a method to reason about logic specifications.
Cut elimination in multifocused linear logic
DEFF Research Database (Denmark)
Guenot, Nicolas; Brock-Nannestad, Taus
2015-01-01
We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping rule instances in focusing phases. We show that cut...... elimination can be performed in a sensible way even though the proof requires some specific lemmas to deal with multifocusing phases, and discuss the difficulties arising with cut elimination when considering normal forms of proofs in linear logic....
Linear Temporal Logic-based Mission Planning
Anil Kumar; Rahul Kala
2016-01-01
In this paper, we describe the Linear Temporal Logic-based reactive motion planning. We address the problem of motion planning for mobile robots, wherein the goal specification of planning is given in complex environments. The desired task specification may consist of complex behaviors of the robot, including specifications for environment constraints, need of task optimality, obstacle avoidance, rescue specifications, surveillance specifications, safety specifications, etc. We use Linear Tem...
Completeness Results for Linear Logic on Petri Nets
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
1993-01-01
Completeness is shown for several versions of Girard's linear logic with respect to Petri nets as the class of models. The strongest logic considered is intuitionistic linear logic, with $otimes$, $-!circ$, &, $oplus$ and the exponential ! (''of course´´), and forms of quantification. This logic ...
Linear Temporal Logic-based Mission Planning
Directory of Open Access Journals (Sweden)
Anil Kumar
2016-06-01
Full Text Available In this paper, we describe the Linear Temporal Logic-based reactive motion planning. We address the problem of motion planning for mobile robots, wherein the goal specification of planning is given in complex environments. The desired task specification may consist of complex behaviors of the robot, including specifications for environment constraints, need of task optimality, obstacle avoidance, rescue specifications, surveillance specifications, safety specifications, etc. We use Linear Temporal Logic to give a representation for such complex task specification and constraints. The specifications are used by a verification engine to judge the feasibility and suitability of plans. The planner gives a motion strategy as output. Finally a controller is used to generate the desired trajectory to achieve such a goal. The approach is tested using simulations on the LTLMoP mission planning tool, operating over the Robot Operating System. Simulation results generated using high level planners and low level controllers work simultaneously for mission planning and controlling the physical behavior of the robot.
On Multiplicative Linear Logic, Modality and Quantum Circuits
Directory of Open Access Journals (Sweden)
Ugo Dal Lago
2012-10-01
Full Text Available A logical system derived from linear logic and called QMLL is introduced and shown able to capture all unitary quantum circuits. Conversely, any proof is shown to compute, through a concrete GoI interpretation, some quantum circuits. The system QMLL, which enjoys cut-elimination, is obtained by endowing multiplicative linear logic with a quantum modality.
Dynamic logic architecture based on piecewise-linear systems
International Nuclear Information System (INIS)
Peng Haipeng; Liu Fei; Li Lixiang; Yang Yixian; Wang Xue
2010-01-01
This Letter explores piecewise-linear systems to construct dynamic logic architecture. The proposed schemes can discriminate the two input signals and obtain 16 kinds of logic operations by different combinations of parameters and conditions for determining the output. Each logic cell performs more flexibly, that makes it possible to achieve complex logic operations more simply and construct computing architecture with less logic cells. We also analyze the various performances of our schemes under different conditions and the characteristics of these schemes.
Hybrid logic on linear structures: expressivity and complexity
Franceschet, M.; de Rijke, M.; Schlingoff, B.-H.
2003-01-01
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algorithmically well behaved. Therefore, they are well suited for the specification of certain properties of computational
A logic circuit for solving linear function by digital method
International Nuclear Information System (INIS)
Ma Yonghe
1986-01-01
A mathematical method for determining the linear relation of physical quantity with rediation intensity is described. A logic circuit has been designed for solving linear function by digital method. Some applications and the circuit function are discussed
Lincx: A Linear Logical Framework with First-class Contexts
DEFF Research Database (Denmark)
Linn Georges, Aina; Murawska, Agata; Otis, Shawn
2017-01-01
Linear logic provides an elegant framework for modelling stateful, imperative and concurrent systems by viewing a context of assumptions as a set of resources. However, mechanizing the meta-theory of such systems remains a challenge, as we need to manage and reason about mixed contexts of linear...
Minimality of critical scenarios with linear logic and cutsets
African Journals Online (AJOL)
DK
Keywords: Dependability - Mechatronic systems -Petri net - Linear logic - Minimal Feared scenarios - Cutsets. ..... Energy supply. Detection high level. Relay. ET. Energy supply. Detection high level. Relay ..... Evaluation de la SdF des systèmes mécatroniques en utilisant ... in complex distributed systems, Proceedings of the.
Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae
Rosu, Grigore; Havelund, Klaus
2001-01-01
The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.
Logical Qubit in a Linear Array of Semiconductor Quantum Dots
Directory of Open Access Journals (Sweden)
Cody Jones
2018-06-01
Full Text Available We design a logical qubit consisting of a linear array of quantum dots, we analyze error correction for this linear architecture, and we propose a sequence of experiments to demonstrate components of the logical qubit on near-term devices. To avoid the difficulty of fully controlling a two-dimensional array of dots, we adapt spin control and error correction to a one-dimensional line of silicon quantum dots. Control speed and efficiency are maintained via a scheme in which electron spin states are controlled globally using broadband microwave pulses for magnetic resonance, while two-qubit gates are provided by local electrical control of the exchange interaction between neighboring dots. Error correction with two-, three-, and four-qubit codes is adapted to a linear chain of qubits with nearest-neighbor gates. We estimate an error correction threshold of 10^{-4}. Furthermore, we describe a sequence of experiments to validate the methods on near-term devices starting from four coupled dots.
Testing Linear Temporal Logic Formulae on Finite Execution Traces
Havelund, Klaus; Rosu, Grigore; Norvig, Peter (Technical Monitor)
2001-01-01
We present an algorithm for efficiently testing Linear Temporal Logic (LTL) formulae on finite execution traces. The standard models of LTL are infinite traces, reflecting the behavior of reactive and concurrent systems which conceptually may be continuously alive. In most past applications of LTL. theorem provers and model checkers have been used to formally prove that down-scaled models satisfy such LTL specifications. Our goal is instead to use LTL for up-scaled testing of real software applications. Such tests correspond to analyzing the conformance of finite traces against LTL formulae. We first describe what it means for a finite trace to satisfy an LTL property. We then suggest an optimized algorithm based on transforming LTL formulae. The work is done using the Maude rewriting system. which turns out to provide a perfect notation and an efficient rewriting engine for performing these experiments.
Logic Reduced To Bare (Proof-Theoretical) Bones
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav
2015-01-01
Roč. 24, č. 2 (2015), s. 193-209 ISSN 0925-8531 Institutional support: RVO:67985955 Keywords : inference * incompatibility * proof theory * intuitionistic logic Subject RIV: AA - Philosophy ; Religion Impact factor: 0.450, year: 2015
Normal Forms for Fuzzy Logics: A Proof-Theoretic Approach
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Metcalfe, G.
2007-01-01
Roč. 46, č. 5-6 (2007), s. 347-363 ISSN 1432-0665 R&D Projects: GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : fuzzy logic * normal form * proof theory * hypersequents Subject RIV: BA - General Mathematics Impact factor: 0.620, year: 2007
A Modal Logic for the Decision-Theoretic Projection Problem
CSIR Research Space (South Africa)
Rens, GB
2015-01-01
Full Text Available The authors present a decidable logic in which queries can be posed about (i) the degree of belief in a propositional sentence after an arbitrary finite number of actions and observations and (ii) the utility of a finite sequence of actions after a...
Quantum field theory and coalgebraic logic in theoretical computer science.
Basti, Gianfranco; Capolupo, Antonio; Vitiello, Giuseppe
2017-11-01
We suggest that in the framework of the Category Theory it is possible to demonstrate the mathematical and logical dual equivalence between the category of the q-deformed Hopf Coalgebras and the category of the q-deformed Hopf Algebras in quantum field theory (QFT), interpreted as a thermal field theory. Each pair algebra-coalgebra characterizes a QFT system and its mirroring thermal bath, respectively, so to model dissipative quantum systems in far-from-equilibrium conditions, with an evident significance also for biological sciences. Our study is in fact inspired by applications to neuroscience where the brain memory capacity, for instance, has been modeled by using the QFT unitarily inequivalent representations. The q-deformed Hopf Coalgebras and the q-deformed Hopf Algebras constitute two dual categories because characterized by the same functor T, related with the Bogoliubov transform, and by its contravariant application T op , respectively. The q-deformation parameter is related to the Bogoliubov angle, and it is effectively a thermal parameter. Therefore, the different values of q identify univocally, and label the vacua appearing in the foliation process of the quantum vacuum. This means that, in the framework of Universal Coalgebra, as general theory of dynamic and computing systems ("labelled state-transition systems"), the so labelled infinitely many quantum vacua can be interpreted as the Final Coalgebra of an "Infinite State Black-Box Machine". All this opens the way to the possibility of designing a new class of universal quantum computing architectures based on this coalgebraic QFT formulation, as its ability of naturally generating a Fibonacci progression demonstrates. Copyright © 2017 Elsevier Ltd. All rights reserved.
Configurable unitary transformations and linear logic gates using quantum memories.
Campbell, G T; Pinel, O; Hosseini, M; Ralph, T C; Buchler, B C; Lam, P K
2014-08-08
We show that a set of optical memories can act as a configurable linear optical network operating on frequency-multiplexed optical states. Our protocol is applicable to any quantum memories that employ off-resonant Raman transitions to store optical information in atomic spins. In addition to the configurability, the protocol also offers favorable scaling with an increasing number of modes where N memories can be configured to implement arbitrary N-mode unitary operations during storage and readout. We demonstrate the versatility of this protocol by showing an example where cascaded memories are used to implement a conditional cz gate.
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
DEFF Research Database (Denmark)
Møgelberg, Rasmus Ejlers; Birkedal, Lars; Rosolini, Guiseppe
2008-01-01
Plotkin suggested using a polymorphic dual intuitionistic/linear type theory (PILLY) as a metalanguage for parametric polymorphism and recursion. In recent work the first two authors and R.L. Petersen have defined a notion of parametric LAPL-structure, which are models of PILLY, in which one can...... reason using parametricity and, for example, solve a large class of domain equations, as suggested by Plotkin.In this paper, we show how an interpretation of a strict version of Bierman, Pitts and Russo's language Lily into synthetic domain theory presented by Simpson and Rosolini gives rise...... to a parametric LAPL-structure. This adds to the evidence that the notion of LAPL-structure is a general notion, suitable for treating many different parametric models, and it provides formal proofs of consequences of parametricity expected to hold for the interpretation. Finally, we show how these results...
Undecidability of the Logic of Overlap Relation over Discrete Linear Orderings
DEFF Research Database (Denmark)
Bresolin, Davide; Della Monica, Dario; Goranko, Valentin
2010-01-01
. Still, decidability is the rule for the fragments of HS with only one modal operator, based on an Allen’s relation. In this paper, we show that the logic O of the Overlap relation, when interpreted over discrete linear orderings, is an exception. The proof is based on a reduction from the undecidable...
Passive linear-optics 640 Gbit/s logic NOT gate
DEFF Research Database (Denmark)
Maram, Reza; Kong, Deming; Galili, Michael
2015-01-01
We experimentally demonstrate a 640 Gbit/s all-optical NOT gate for high-speed telecommunication on-off-keying (OOK) data signals. We employ linear optical signal processing based on spectral phase-only (all-pass) optical filtering to perform the target logic NOT operation....
Directory of Open Access Journals (Sweden)
N. Jaya
2008-10-01
Full Text Available In this work, a design and implementation of a Conventional PI controller, single region fuzzy logic controller, two region fuzzy logic controller and Globally Linearized Controller (GLC for a two capacity interacting nonlinear process is carried out. The performance of this process using single region FLC, two region FLC and GLC are compared with the performance of conventional PI controller about an operating point of 50 %. It has been observed that GLC and two region FLC provides better performance. Further, this procedure is also validated by real time experimentation using dSPACE.
Linear Time Logics around PSL: Complexity, Expressiveness, and a little bit of Succinctness
DEFF Research Database (Denmark)
Lange, Martin
2007-01-01
We consider linear time temporal logic enriched with semi-extended regular expressions through various operators that have been proposed in the literature, in particular in Accelera's Property Specification Language. We obtain results about the expressive power of fragments of this logic when...... restricted to certain operators only: basically, all operators alone suffice for expressive completeness w.r.t.\\ omega-regular expressions, just the closure operator is too weak. We also obtain complexity results. Again, almost all operators alone suffice for EXPSPACE-completeness, just the closure operator...
Theoretical analysis of balanced truncation for linear switched systems
DEFF Research Database (Denmark)
Petreczky, Mihaly; Wisniewski, Rafal; Leth, John-Josef
2012-01-01
In this paper we present theoretical analysis of model reduction of linear switched systems based on balanced truncation, presented in [1,2]. More precisely, (1) we provide a bound on the estimation error using L2 gain, (2) we provide a system theoretic interpretation of grammians and their singu......In this paper we present theoretical analysis of model reduction of linear switched systems based on balanced truncation, presented in [1,2]. More precisely, (1) we provide a bound on the estimation error using L2 gain, (2) we provide a system theoretic interpretation of grammians...... for showing this independence is realization theory of linear switched systems. [1] H. R. Shaker and R. Wisniewski, "Generalized gramian framework for model/controller order reduction of switched systems", International Journal of Systems Science, Vol. 42, Issue 8, 2011, 1277-1291. [2] H. R. Shaker and R....... Wisniewski, "Switched Systems Reduction Framework Based on Convex Combination of Generalized Gramians", Journal of Control Science and Engineering, 2009....
Experimental investigation of a four-qubit linear-optical quantum logic circuit.
Stárek, R; Mičuda, M; Miková, M; Straka, I; Dušek, M; Ježek, M; Fiurášek, J
2016-09-20
We experimentally demonstrate and characterize a four-qubit linear-optical quantum logic circuit. Our robust and versatile scheme exploits encoding of two qubits into polarization and path degrees of single photons and involves two crossed inherently stable interferometers. This approach allows us to design a complex quantum logic circuit that combines a genuine four-qubit C(3)Z gate and several two-qubit and single-qubit gates. The C(3)Z gate introduces a sign flip if and only if all four qubits are in the computational state |1〉. We verify high-fidelity performance of this central four-qubit gate using Hofmann bounds on quantum gate fidelity and Monte Carlo fidelity sampling. We also experimentally demonstrate that the quantum logic circuit can generate genuine multipartite entanglement and we certify the entanglement with the use of suitably tailored entanglement witnesses.
A Bayesian Decision-Theoretic Approach to Logically-Consistent Hypothesis Testing
Directory of Open Access Journals (Sweden)
Gustavo Miranda da Silva
2015-09-01
Full Text Available This work addresses an important issue regarding the performance of simultaneous test procedures: the construction of multiple tests that at the same time are optimal from a statistical perspective and that also yield logically-consistent results that are easy to communicate to practitioners of statistical methods. For instance, if hypothesis A implies hypothesis B, is it possible to create optimal testing procedures that reject A whenever they reject B? Unfortunately, several standard testing procedures fail in having such logical consistency. Although this has been deeply investigated under a frequentist perspective, the literature lacks analyses under a Bayesian paradigm. In this work, we contribute to the discussion by investigating three rational relationships under a Bayesian decision-theoretic standpoint: coherence, invertibility and union consonance. We characterize and illustrate through simple examples optimal Bayes tests that fulfill each of these requisites separately. We also explore how far one can go by putting these requirements together. We show that although fairly intuitive tests satisfy both coherence and invertibility, no Bayesian testing scheme meets the desiderata as a whole, strengthening the understanding that logical consistency cannot be combined with statistical optimality in general. Finally, we associate Bayesian hypothesis testing with Bayes point estimation procedures. We prove the performance of logically-consistent hypothesis testing by means of a Bayes point estimator to be optimal only under very restrictive conditions.
Predicting recycling behaviour: Comparison of a linear regression model and a fuzzy logic model.
Vesely, Stepan; Klöckner, Christian A; Dohnal, Mirko
2016-03-01
In this paper we demonstrate that fuzzy logic can provide a better tool for predicting recycling behaviour than the customarily used linear regression. To show this, we take a set of empirical data on recycling behaviour (N=664), which we randomly divide into two halves. The first half is used to estimate a linear regression model of recycling behaviour, and to develop a fuzzy logic model of recycling behaviour. As the first comparison, the fit of both models to the data included in estimation of the models (N=332) is evaluated. As the second comparison, predictive accuracy of both models for "new" cases (hold-out data not included in building the models, N=332) is assessed. In both cases, the fuzzy logic model significantly outperforms the regression model in terms of fit. To conclude, when accurate predictions of recycling and possibly other environmental behaviours are needed, fuzzy logic modelling seems to be a promising technique. Copyright © 2015 Elsevier Ltd. All rights reserved.
Slater, Michael D
2006-01-01
While increasingly widespread use of behavior change theory is an advance for communication campaigns and their evaluation, such theories provide a necessary but not sufficient condition for theory-based communication interventions. Such interventions and their evaluations need to incorporate theoretical thinking about plausible mechanisms of message effect on health-related attitudes and behavior. Otherwise, strategic errors in message design and dissemination, and misspecified campaign logic models, insensitive to campaign effects, are likely to result. Implications of the elaboration likelihood model, attitude accessibility, attitude to the ad theory, exemplification, and framing are explored, and implications for campaign strategy and evaluation designs are briefly discussed. Initial propositions are advanced regarding a theory of campaign affect generalization derived from attitude to ad theory, and regarding a theory of reframing targeted health behaviors in those difficult contexts in which intended audiences are resistant to the advocated behavior or message.
Parameterized Linear Temporal Logics Meet Costs: Still not Costlier than LTL
Directory of Open Access Journals (Sweden)
Martin Zimmermann
2015-09-01
Full Text Available We continue the investigation of parameterized extensions of Linear Temporal Logic (LTL that retain the attractive algorithmic properties of LTL: a polynomial space model checking algorithm and a doubly-exponential time algorithm for solving games. Alur et al. and Kupferman et al. showed that this is the case for Parametric LTL (PLTL and PROMPT-LTL respectively, which have temporal operators equipped with variables that bound their scope in time. Later, this was also shown to be true for Parametric LDL (PLDL, which extends PLTL to be able to express all omega-regular properties. Here, we generalize PLTL to systems with costs, i.e., we do not bound the scope of operators in time, but bound the scope in terms of the cost accumulated during time. Again, we show that model checking and solving games for specifications in PLTL with costs is not harder than the corresponding problems for LTL. Finally, we discuss PLDL with costs and extensions to multiple cost functions.
Proton linear accelerators: A theoretical and historical introduction
International Nuclear Information System (INIS)
Lapostolle, P.M.
1989-07-01
From the beginning, the development of linear accelerators has followed a number of different directions. This report surveys the basic ideas and general principles of such machines, pointing out the problems that have led to the various improvements, with the hope that it may also aid further progress. After a brief historical survey, the principal aspects of accelerator theory are covered in some detail: phase stability, focusing, radio-frequency accelerating structures, the detailed calculation of particle dynamics, and space-charge effects at high intensities. These developments apply essentially to proton and ion accelerators, and only the last chapter deals with a few aspects relative to electrons. 134 refs
a fuzzy logic approach to non-linearity problem of load frequency
African Journals Online (AJOL)
user
2016-07-03
Jul 3, 2016 ... reduction in settling time, percent overshoot and steady state error. Keywords: fuzzy logic ... power system to regain a state of operating equilibrium given ... power system depends basically on the active (real) power balance ...
Detection of epistatic effects with logic regression and a classical linear regression model.
Malina, Magdalena; Ickstadt, Katja; Schwender, Holger; Posch, Martin; Bogdan, Małgorzata
2014-02-01
To locate multiple interacting quantitative trait loci (QTL) influencing a trait of interest within experimental populations, usually methods as the Cockerham's model are applied. Within this framework, interactions are understood as the part of the joined effect of several genes which cannot be explained as the sum of their additive effects. However, if a change in the phenotype (as disease) is caused by Boolean combinations of genotypes of several QTLs, this Cockerham's approach is often not capable to identify them properly. To detect such interactions more efficiently, we propose a logic regression framework. Even though with the logic regression approach a larger number of models has to be considered (requiring more stringent multiple testing correction) the efficient representation of higher order logic interactions in logic regression models leads to a significant increase of power to detect such interactions as compared to a Cockerham's approach. The increase in power is demonstrated analytically for a simple two-way interaction model and illustrated in more complex settings with simulation study and real data analysis.
Durand, S.; Tellier, C. R.
1996-02-01
This paper constitutes the first part of a work devoted to applications of piezoresistance effects in germanium and silicon semiconductors. In this part, emphasis is placed on a formal explanation of non-linear effects. We propose a brief phenomenological description based on the multi-valleys model of semiconductors before to adopt a macroscopic tensorial model from which general analytical expressions for primed non-linear piezoresistance coefficients are derived. Graphical representations of linear and non-linear piezoresistance coefficients allows us to characterize the influence of the two angles of cut and of directions of alignment. The second part will primarily deal with specific applications for piezoresistive sensors. Cette publication constitue la première partie d'un travail consacré aux applications des effets piézorésistifs dans les semiconducteurs germanium et silicium. Cette partie traite essentiellement de la modélisation des effets non-linéaires. Après une description phénoménologique à partir du modèle de bande des semiconducteurs nous développons un modèle tensoriel macroscopique et nous proposons des équations générales analytiques exprimant les coefficients piézorésistifs non-linéaires dans des repères tournés. Des représentations graphiques des variations des coefficients piézorésistifs linéaires et non-linéaires permettent une pré-caractérisation de l'influence des angles de coupes et des directions d'alignement avant l'étude d'applications spécifiques qui feront l'objet de la deuxième partie.
Le Balleur, J. C.
1988-01-01
The applicability of conventional mathematical analysis (based on the combination of two-valued logic and probability theory) to problems in which human judgment, perception, or emotions play significant roles is considered theoretically. It is shown that dispositional logic, a branch of fuzzy logic, has particular relevance to the common-sense reasoning typical of human decision-making. The concepts of dispositionality and usuality are defined analytically, and a dispositional conjunctive rule and dispositional modus ponens are derived.
Microelectromechanical reprogrammable logic device
Hafiz, Md Abdullah Al; Kosuru, Lakshmoji; Younis, Mohammad I.
2016-01-01
on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance
Experimental and Theoretical Progress of Linear Collider Final Focus Design and ATF2 Facility
Seryi, Andrei; Zimmermann, Frank; Kubo, Kiyoshi; Kuroda, Shigeru; Okugi, Toshiyuki; Tauchi, Toshiaki; Terunuma, Nobuhiro; Urakawa, Junji; White, Glen; Woodley, Mark; Angal-Kalinin, Deepa
2014-01-01
In this brief overview we will reflect on the process of the design of the linear collider (LC) final focus (FF) optics, and will also describe the theoretical and experimental efforts on design and practical realisation of a prototype of the LC FF optics implemented in the ATF2 facility at KEK, Japan, presently being commissioned and operated.
DEFF Research Database (Denmark)
Fränzle, Martin; Herde, Christian
2003-01-01
We investigate the problem of generalizing acceleration techniques as found in recent satisfiability engines for conjunctive normal forms (CNFs) to linear constraint systems over the Booleans. The rationale behind this research is that rewriting the propositional formulae occurring in e.g. bounde...
Theoretical foundations of functional data analysis, with an introduction to linear operators
Hsing, Tailen
2015-01-01
Theoretical Foundations of Functional Data Analysis, with an Introduction to Linear Operators provides a uniquely broad compendium of the key mathematical concepts and results that are relevant for the theoretical development of functional data analysis (FDA).The self-contained treatment of selected topics of functional analysis and operator theory includes reproducing kernel Hilbert spaces, singular value decomposition of compact operators on Hilbert spaces and perturbation theory for both self-adjoint and non self-adjoint operators. The probabilistic foundation for FDA is described from the
Scholz, Stefan; Graf von der Schulenburg, Johann-Matthias; Greiner, Wolfgang
2015-11-17
Regional differences in physician supply can be found in many health care systems, regardless of their organizational and financial structure. A theoretical model is developed for the physicians' decision on office allocation, covering demand-side factors and a consumption time function. To test the propositions following the theoretical model, generalized linear models were estimated to explain differences in 412 German districts. Various factors found in the literature were included to control for physicians' regional preferences. Evidence in favor of the first three propositions of the theoretical model could be found. Specialists show a stronger association to higher populated districts than GPs. Although indicators for regional preferences are significantly correlated with physician density, their coefficients are not as high as population density. If regional disparities should be addressed by political actions, the focus should be to counteract those parameters representing physicians' preferences in over- and undersupplied regions.
THRESHOLD LOGIC IN ARTIFICIAL INTELLIGENCE
COMPUTER LOGIC, ARTIFICIAL INTELLIGENCE , BIONICS, GEOMETRY, INPUT OUTPUT DEVICES, LINEAR PROGRAMMING, MATHEMATICAL LOGIC, MATHEMATICAL PREDICTION, NETWORKS, PATTERN RECOGNITION, PROBABILITY, SWITCHING CIRCUITS, SYNTHESIS
Varadarajan, Divya; Haldar, Justin P
2017-11-01
The data measured in diffusion MRI can be modeled as the Fourier transform of the Ensemble Average Propagator (EAP), a probability distribution that summarizes the molecular diffusion behavior of the spins within each voxel. This Fourier relationship is potentially advantageous because of the extensive theory that has been developed to characterize the sampling requirements, accuracy, and stability of linear Fourier reconstruction methods. However, existing diffusion MRI data sampling and signal estimation methods have largely been developed and tuned without the benefit of such theory, instead relying on approximations, intuition, and extensive empirical evaluation. This paper aims to address this discrepancy by introducing a novel theoretical signal processing framework for diffusion MRI. The new framework can be used to characterize arbitrary linear diffusion estimation methods with arbitrary q-space sampling, and can be used to theoretically evaluate and compare the accuracy, resolution, and noise-resilience of different data acquisition and parameter estimation techniques. The framework is based on the EAP, and makes very limited modeling assumptions. As a result, the approach can even provide new insight into the behavior of model-based linear diffusion estimation methods in contexts where the modeling assumptions are inaccurate. The practical usefulness of the proposed framework is illustrated using both simulated and real diffusion MRI data in applications such as choosing between different parameter estimation methods and choosing between different q-space sampling schemes. Copyright © 2017 Elsevier Inc. All rights reserved.
Linear Logical Voting Protocols
DEFF Research Database (Denmark)
DeYoung, Henry; Schürmann, Carsten
2012-01-01
Current approaches to electronic implementations of voting protocols involve translating legal text to source code of an imperative programming language. Because the gap between legal text and source code is very large, it is difficult to trust that the program meets its legal specification. In r...
Semantic theory for logic programming
Energy Technology Data Exchange (ETDEWEB)
Brown, F M
1981-01-01
The author axiomatizes a number of meta theoretic concepts which have been used in logic programming, including: meaning, logical truth, nonentailment, assertion and erasure, thus showing that these concepts are logical in nature and need not be defined as they have previously been defined in terms of the operations of any particular interpreter for logic programs. 10 references.
Li, Zukui; Ding, Ran; Floudas, Christodoulos A.
2011-01-01
Robust counterpart optimization techniques for linear optimization and mixed integer linear optimization problems are studied in this paper. Different uncertainty sets, including those studied in literature (i.e., interval set; combined interval and ellipsoidal set; combined interval and polyhedral set) and new ones (i.e., adjustable box; pure ellipsoidal; pure polyhedral; combined interval, ellipsoidal, and polyhedral set) are studied in this work and their geometric relationship is discussed. For uncertainty in the left hand side, right hand side, and objective function of the optimization problems, robust counterpart optimization formulations induced by those different uncertainty sets are derived. Numerical studies are performed to compare the solutions of the robust counterpart optimization models and applications in refinery production planning and batch process scheduling problem are presented. PMID:21935263
Elliott, D. G.
1977-01-01
Measurements of reaction rail currents, reaction rail voltages, and airgap magnetic fields in tests of the Linear Induction Motor Research Vehicle (LIMRV) were compared with theoretical calculations from the mesh/matrix theory. It was found that the rail currents and magnetic fields predicted by the theory are within 20 percent of the measured currents and fields at most motor locations in most of the runs, but differ by as much as a factor of two in some cases. The most consistent difference is a higher experimental than theoretical magnetic field near the entrance of the motor and a lower experimental than theoretical magnetic field near the exit. The observed differences between the theoretical and experimental magnetic fields and currents do not account for the differences of as much as 26 percent between the theoretical and experimental thrusts.
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
International Nuclear Information System (INIS)
Rosicka, M; Ramanathan, R; Gnaciński, P; Horodecki, M; Horodecki, K; Horodecki, P; Severini, S
2016-01-01
We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions. (paper)
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
Rosicka, M.; Ramanathan, R.; Gnaciński, P.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Severini, S.
2016-04-01
We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR (XOR-d) games we study are a subclass of the well-known linear games. We introduce a ‘constraint graph’ associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the graph-theoretic characterization to relate the task of finding equivalent games to the notion of signed graphs and switching equivalence from graph theory. We relate the problem of computing the classical value of single-party anti-correlation XOR games to finding the edge bipartization number of a graph, which is known to be MaxSNP hard, and connect the computation of the classical value of XOR-d games to the identification of specific cycles in the graph. We construct an orthogonality graph of the game from the constraint graph and study its Lovász theta number as a general upper bound on the quantum value even in the case of single-party contextual XOR-d games. XOR-d games possess appealing properties for use in device-independent applications such as randomness of the local correlated outcomes in the optimal quantum strategy. We study the possibility of obtaining quantum algebraic violation of these games, and show that no finite XOR-d game possesses the property of pseudo-telepathy leaving the frequently used chained Bell inequalities as the natural candidates for such applications. We also show this lack of pseudo-telepathy for multi-party XOR-type inequalities involving two-body correlation functions.
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students......A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students...
Mendenhall, Jonathan D.
's and other micellization properties for a variety of linear and branched surfactant chemical architectures which are commonly encountered in practice. Single-component surfactant solutions are investigated, in order to clarify the specific contributions of the surfactant head and tail to the free energy of micellization, a quantity which determines the cmc and all other aspects of micellization. First, a molecular-thermodynamic (MT) theory is presented which makes use of bulk-phase thermodynamics and a phenomenological thought process to describe the energetics related to the formation of a micelle from its constituent surfactant monomers. Second, a combined computer-simulation/molecular-thermodynamic (CSMT) framework is discussed which provides a more detailed quantification of the hydrophobic effect using molecular dynamics simulations. A novel computational strategy to identify surfactant head and tail using an iterative dividing surface approach, along with simulated micelle results, is proposed. Force-field development for novel surfactant structures is also discussed. Third, a statistical-thermodynamic, single-chain, mean-field theory for linear and branched tail packing is formulated, which enables quantification of the specific energetic penalties related to confinement and constraint of surfactant tails within micelles. Finally, these theoretical and simulations-based strategies are used to predict the micellization behavior of 55 linear surfactants and 28 branched surfactants. Critical micelle concentration and optimal micelle properties are reported and compared with experiment, demonstrating good agreement across a range of surfactant head and tail types. In particular, the CSMT framework is found to provide improved agreement with experimental cmc's for the branched surfactants considered. (Copies available exclusively from MIT Libraries, libraries.mit.edu/docs - docs mit.edu)
Holakooie, Mohammad Hosein; Ojaghi, Mansour; Taheri, Asghar
2016-01-01
This paper investigates sensorless indirect field oriented control (IFOC) of SLIM with full-order Luenberger observer. The dynamic equations of SLIM are first elaborated to draw full-order Luenberger observer with some simplifying assumption. The observer gain matrix is derived from conventional procedure so that observer poles are proportional to SLIM poles to ensure the stability of system for wide range of linear speed. The operation of observer is significantly impressed by adaptive scheme. A fuzzy logic control (FLC) is proposed as adaptive scheme to estimate linear speed using speed tuning signal. The parameters of FLC are tuned using an off-line method through chaotic optimization algorithm (COA). The performance of the proposed observer is verified by both numerical simulation and real-time hardware-in-the-loop (HIL) implementation. Moreover, a detailed comparative study among proposed and other speed observers is obtained under different operation conditions. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.
Institutional Logics in Action
DEFF Research Database (Denmark)
Lounsbury, Michael; Boxenbaum, Eva
2013-01-01
This double volume presents state-of-the-art research and thinking on the dynamics of actors and institutional logics. In the introduction, we briefly sketch the roots and branches of institutional logics scholarship before turning to the new buds of research on the topic of how actors engage...... institutional logics in the course of their organizational practice. We introduce an exciting line of new works on the meta-theoretical foundations of logics, institutional logic processes, and institutional complexity and organizational responses. Collectively, the papers in this volume advance the very...... prolific stream of research on institutional logics by deepening our insight into the active use of institutional logics in organizational action and interaction, including the institutional effects of such (inter)actions....
Fuzzy Logic vs. Neutrosophic Logic: Operations Logic
Directory of Open Access Journals (Sweden)
Salah Bouzina
2016-12-01
Full Text Available The goal of this research is first to show how different, thorough, widespread and effective are the operations logic of the neutrosophic logic compared to the fuzzy logic’s operations logical. The second aim is to observe how a fully new logic, the neutrosophic logic, is established starting by changing the previous logical perspective fuzzy logic, and by changing that, we mean changing changing the truth values from the truth and falsity degrees membership in fuzzy logic, to the truth, falsity and indeterminacy degrees membership in neutrosophic logic; and thirdly, to observe that there is no limit to the logical discoveries - we only change the principle, then the system changes completely.
DEFF Research Database (Denmark)
Carbone, Marco; Montesi, Fabrizio; Schürmann, Carsten
2014-01-01
In Choreographic Programming, a distributed system is programmed by giving a choreography, a global description of its interactions, instead of separately specifying the behaviour of each of its processes. Process implementations in terms of a distributed language can then be automatically...... projected from a choreography. We present Linear Compositional Choreographies (LCC), a proof theory for reasoning about programs that modularly combine choreographies with processes. Using LCC, we logically reconstruct a semantics and a projection procedure for programs. For the first time, we also obtain...... a procedure for extracting choreographies from process terms....
Groups, matrices, and vector spaces a group theoretic approach to linear algebra
Carrell, James B
2017-01-01
This unique text provides a geometric approach to group theory and linear algebra, bringing to light the interesting ways in which these subjects interact. Requiring few prerequisites beyond understanding the notion of a proof, the text aims to give students a strong foundation in both geometry and algebra. Starting with preliminaries (relations, elementary combinatorics, and induction), the book then proceeds to the core topics: the elements of the theory of groups and fields (Lagrange's Theorem, cosets, the complex numbers and the prime fields), matrix theory and matrix groups, determinants, vector spaces, linear mappings, eigentheory and diagonalization, Jordan decomposition and normal form, normal matrices, and quadratic forms. The final two chapters consist of a more intensive look at group theory, emphasizing orbit stabilizer methods, and an introduction to linear algebraic groups, which enriches the notion of a matrix group. Applications involving symm etry groups, determinants, linear coding theory ...
Chakraborty, Mitesh; Rai, Vineet Kumar
2017-12-01
The aim of the present paper is to employ theoretical methods to investigate the zero field splitting (ZFS) parameter and to investigate the position of the dopant in the host. These theoretical calculations have been compared with the empirical results. The superposition model (SPM) with the microscopic spin-Hamiltonian (MSH) theory and the coefficient of fractional parentage have been employed to investigate the dopant manganese(II) ion substitution in the diaquamalonatozinc(II) (DAMZ) single crystal. The magnetic parameters, viz. g-tensor and D-tensor, has been determined by using the ORCA program package developed by F Neese et al. The unrestricted Kohn-Sham orbitals-based Pederson-Khanna (PK) as the unperturbed wave function is observed to be the most suitable for the computational calculation of spin-orbit tensor (D^{SO}) of the axial ZFS parameter D. The effects of spin-spin dipolar couplings are taken into account. The unrestricted natural orbital (UNO) is used for the calculation of spin-spin dipolar contributions to the ZFS tensor. A comparative study of the quantum mechanical treatment of Pederson-Khanna (PK) with coupled perturbation (CP) is reported in the present study. The unrestricted Kohn-Sham-based natural orbital with Pederson-Khanna-type of perturbation approach validates the experimental results in the evaluation of ZFS parameters. The theoretical results are appropriate with the experimental ones and indicate the interstitial occupancy of Mn^{2+} ion in the host matrix.
International Nuclear Information System (INIS)
Finkelstein, D.
1987-01-01
The von Neumann quantum logic lacks two basic symmetries of classical logic, that between sets and classes, and that between lower and higher order predicates. Similarly, the structural parallel between the set algebra and linear algebra of Grassmann and Peano was left incomplete by them in two respects. In this work a linear algebra is constructed that completes this correspondence and is interpreted as a new quantum logic that restores these invariances, and as a quantum set theory. It applies to experiments with coherent quantum phase relations between the quantum and the apparatus. The quantum set theory is applied to model a Lorentz-invariant quantum time-space complex
Directory of Open Access Journals (Sweden)
Ali Selamat
2012-01-01
Full Text Available Sensitivity-based linear learning method (SBLLM has recently been used as a predictive tool due to its unique characteristics and performance, particularly its high stability and consistency during predictions. However, the generalisation capability of SBLLM is sometimes limited depending on the nature of the dataset, particularly on whether uncertainty is present in the dataset or not. Since it made use of sensitivity analysis in relation to the data sets used, it is surely very prone to being affected by the nature of the dataset. In order to reduce the effects of uncertainties in SBLLM prediction and improve its generalisation ability, this paper proposes a hybrid system through the unique combination of type-2 fuzzy logic systems (type-2 FLSs and SBLLM; thereafter the hybrid system was used to model PVT properties of crude oil systems. Type-2 FLS has been choosen in order to better handle uncertainties existing in datasets beyond the capability of type-1 fuzzy logic systems. In the proposed hybrid, the type-2 FLS is used to handle uncertainties in reservoir data so that the cleaned data from type-2 FLS is then passed to the SBLLM for training and then final prediction using testing dataset follows. Comparative studies have been carried out to compare the performance of the newly proposed T2-SBLLM hybrid system with each of the constituent type-2 FLS and SBLLM. Empirical results from simulation show that the proposed T2-SBLLM hybrid system has greatly improved upon the performance of SBLLM, while also maintaining a better performance above that of the type-2 FLS.
Directory of Open Access Journals (Sweden)
Tsung-han Tsai
2013-05-01
Full Text Available There is some confusion in political science, and the social sciences in general, about the meaning and interpretation of interaction effects in models with non-interval, non-normal outcome variables. Often these terms are casually thrown into a model specification without observing that their presence fundamentally changes the interpretation of the resulting coefficients. This article explains the conditional nature of reported coefficients in models with interactions, defining the necessarily different interpretation required by generalized linear models. Methodological issues are illustrated with an application to voter information structured by electoral systems and resulting legislative behavior and democratic representation in comparative politics.
International Nuclear Information System (INIS)
England, W.B.
1978-01-01
Uncorrelated and correlated potential energy curves and dipole moments are reported for linear KOH. The compound is found to be ionic, K + OH - . Minimum energy bond lengths are R/sub KO/=4.2913 au and R/sub OH/=1.7688 au, with an estimated accuracy of 2%. The corresponding dipole moment is 3.3 au (8.46 D) with a similar accuracy estimate. This is to our knowledge the first value ever reported for the KOH dipole moment, and the large value suggests that KOH will be an effective electron scatterer in MHD plasmas
Rough set classification based on quantum logic
Hassan, Yasser F.
2017-11-01
By combining the advantages of quantum computing and soft computing, the paper shows that rough sets can be used with quantum logic for classification and recognition systems. We suggest the new definition of rough set theory as quantum logic theory. Rough approximations are essential elements in rough set theory, the quantum rough set model for set-valued data directly construct set approximation based on a kind of quantum similarity relation which is presented here. Theoretical analyses demonstrate that the new model for quantum rough sets has new type of decision rule with less redundancy which can be used to give accurate classification using principles of quantum superposition and non-linear quantum relations. To our knowledge, this is the first attempt aiming to define rough sets in representation of a quantum rather than logic or sets. The experiments on data-sets have demonstrated that the proposed model is more accuracy than the traditional rough sets in terms of finding optimal classifications.
Embedding Logics into Product Logic
Czech Academy of Sciences Publication Activity Database
Baaz, M.; Hájek, Petr; Krajíček, Jan; Švejda, David
1998-01-01
Roč. 61, č. 1 (1998), s. 35-47 ISSN 0039-3215 R&D Projects: GA AV ČR IAA1030601 Grant - others:COST(XE) Action 15 Keywords : fuzzy logic * Lukasiewicz logic * Gödel logic * product logic * computational complexity * arithmetical hierarchy Subject RIV: BA - General Mathematics
Theoretical study of molecular vibration and Application to linear triatomic molecules: case of OCS
International Nuclear Information System (INIS)
Andrianavalomahefa, A.
2014-01-01
Our aim is to give a theoretical approach to the calculation of vibrational energy levels of polyatomic molecules. By using matrix calculation, we have to solve an eigenvalue equation that gives normal vibration frequencies of the system. A basis change introduces normal coordinates of vibration, which diagonalize the Hamiltonian. The harmonic approximation gives a rough evaluation of parameters which describe the system. Then, we introduce nonlinear terms to take into account the anharmonicity of interatomic bounds. Morse oscillator gives good approximation for diatomic molecules. We consider cubic and quartic potential terms for polyatomic molecules. We treat the problem both in classical and quantum approach. The results thus obtained are applied to study longitudinal vibration of carbonyl sulfide. [fr
International Nuclear Information System (INIS)
Bernu, J; Armstrong, S; Symul, T; Lam, P K; Ralph, T C
2014-01-01
We study the operational regime of a noiseless linear amplifier (NLA) based on quantum scissors that can nondeterministically amplify the one photon component of a quantum state with weak excitation. It has been shown that an arbitrarily large quantum state can be amplified by first splitting it into weak excitation states using a network of beamsplitters. The output states of the network can then be coherently recombined. In this paper, we analyse the performance of such a device for distilling entanglement after transmission through a lossy quantum channel, and look at two measures to determine the efficacy of the NLA. The measures used are the amount of entanglement achievable and the final purity of the output amplified entangled state. We study the performances of both a single and a two-element NLA for amplifying weakly excited states. Practically, we show that it may be advantageous to work with a limited number of stages. (paper)
International Nuclear Information System (INIS)
Gonzalez M, V.; Salinas H, J.G.; Espinosa P, G.
2000-01-01
The Technology, Regulation and Services Management of the National Commission of Nuclear Safety and Safeguards in coordinated form with the IPH Department of the Metropolitan Autonomous-Iztapalapa University, developed the present project to study the linear stability in a fuel channel uniformly heated with effects of retrofeeding by vacuums. In this study the methodology used in the analysis of linear stability of the nuclear reactor unit 1 at Laguna Verde power plant is described which represented by an average channel uniformly heated. The conceptual model consists of two cells which represent the two regions in which is divided the channel according to the cooling is in one and two phases, considering the boiling length dependent in the time. It is used the homogeneous flux models for describing the thermohydraulic behavior of the cooling in the two phases region. The neutron processes with the punctual model of the neutron kinetics with a group of retarded neutrons precursors are described. It is studied the behavior of the system in the frequency domain with the transfer functions obtained and it is characterized in four operation states corresponding to the four corners of the low stability zone in the map power-flow Laguna Verde power plant. For these operation states the characteristic frequency is determined and the corresponding Nyquist diagrams are obtained. The results show that the system stability depends on the power-flow relation and that the operations which implicate a reduction of this relation improve the stability of the system (reducing the power introducing control bars with constant cooling flow or increase cooling flow with bars pattern established). The obtained results with effects of retrofeeding by vacuums show that the value of the characteristic frequency is modified very little with respect to the model without retrofeeding, therefore the thermohydraulic processes seem to determine the response of the stability of the system
Smullyan, Raymond
2008-01-01
This book features a unique approach to the teaching of mathematical logic by putting it in the context of the puzzles and paradoxes of common language and rational thought. It serves as a bridge from the author's puzzle books to his technical writing in the fascinating field of mathematical logic. Using the logic of lying and truth-telling, the author introduces the readers to informal reasoning preparing them for the formal study of symbolic logic, from propositional logic to first-order logic, a subject that has many important applications to philosophy, mathematics, and computer science. T
Microelectromechanical reprogrammable logic device
Hafiz, M. A. A.; Kosuru, L.; Younis, M. I.
2016-01-01
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme. PMID:27021295
Microelectromechanical reprogrammable logic device
Hafiz, Md Abdullah Al
2016-03-29
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
DEFF Research Database (Denmark)
Filipiuk, Piotr; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
We present a logic for the specification of static analysis problems that goes beyond the logics traditionally used. Its most prominent feature is the direct support for both inductive computations of behaviors as well as co-inductive specifications of properties. Two main theoretical contributions...... are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping of analyses and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases...
Bisimulations, games, and logic
DEFF Research Database (Denmark)
Nielsen, Mogens; Clausen, Christian
1994-01-01
In a recent paper by Joyal, Nielsen, and Winskel, bisimulation is defined in an abstract and uniform way across a wide range of different models for concurrency. In this paper, following a recent trend in theoretical computer science, we characterize their abstract definition game-theoretically a......-theoretically and logically in a non-interleaving model. Our characterizations appear as surprisingly simple extensions of corresponding characterizations of interleaving bisimulation....
Duality Theory and Categorical Universal Logic: With Emphasis on Quantum Structures
Directory of Open Access Journals (Sweden)
Yoshihiro Maruyama
2014-12-01
Full Text Available Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras, which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical, intuitionistic, and diverse substructural logics. Here we show there are those dual adjunctions that have inherent hyperdoctrine structures in their predicate functor parts. We systematically investigate into the categorical logics of dual adjunctions by utilising Johnstone-Dimov-Tholen's duality-theoretic framework. Our set-theoretical duality-based hyperdoctrines for quantum logic have both universal and existential quantifiers (and higher-order structures, giving rise to a universe of Takeuti-Ozawa's quantum sets via the tripos-to-topos construction by Hyland-Johnstone-Pitts. The set-theoretical hyperdoctrinal models of quantum logic, as well as all quantum hyperdoctrines with cartesian base categories, turn out to give sound and complete semantics for Faggian-Sambin's first-order quantum sequent calculus over cartesian type theory; in addition, quantum hyperdoctrines with monoidal base categories are sound and complete for the calculus over linear type theory. We finally consider how to reconcile Birkhoff-von Neumann's quantum logic and Abramsky-Coecke's categorical quantum mechanics (which is modernised quantum logic as an antithesis to the traditional one via categorical universal logic.
Kleene, Stephen Cole
1967-01-01
Undergraduate students with no prior instruction in mathematical logic will benefit from this multi-part text. Part I offers an elementary but thorough overview of mathematical logic of 1st order. Part II introduces some of the newer ideas and the more profound results of logical research in the 20th century. 1967 edition.
Meyer, J.J.Ch.; Broersen, J.M.; Herzig, A.
2015-01-01
This paper presents an overview of so-called BDI logics, logics where the notion of Beliefs, Desires and Intentions play a central role. Starting out from the basic ideas about BDI by Bratman, we consider various formalizations in logic, such as the approach of Cohen and Levesque, slightly
International Nuclear Information System (INIS)
Bialkowski, J.; Moszynski, M.; Zagorski, A.
1981-01-01
The logic diagram principle of operation and some details of the design of the multiplicity logic unit are presented. This unit was specially designed to fulfil the requirements of a multidetector arrangement for gamma-ray multiplicity measurements. The unit is equipped with 16 inputs controlled by a common coincidence gate. It delivers a linear output pulse with the height proportional to the multiplicity of coincidences and logic pulses corresponding to 0, 1, ... up to >= 5-fold coincidences. These last outputs are used to steer the routing unit working with the multichannel analyser. (orig.)
Mathematical logic foundations for information science
Li, Wei
2010-01-01
This book presents the basic principles and formal calculus of mathematical logic. It covers core contents, extensions and developments of classical mathematical logic, and it offers formal proofs and concrete examples for all theoretical results.
A Current Logical Framework: The Propositional Fragment
National Research Council Canada - National Science Library
Watkins, Kevin
2003-01-01
We present the propositional fragment CLF of the Concurrent Logical Framework (CLF). CLF extends the Linear Logical Framework to allow the natural representation of concurrent computations in an object language...
Logicism, intuitionism, and formalism
Symons, John
2008-01-01
Aims to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. This work is suitable for researchers and graduate students of philosophy, logic, mathematics and theoretical computer science.
Tugué, Tosiyuki; Slaman, Theodore
1989-01-01
These proceedings include the papers presented at the logic meeting held at the Research Institute for Mathematical Sciences, Kyoto University, in the summer of 1987. The meeting mainly covered the current research in various areas of mathematical logic and its applications in Japan. Several lectures were also presented by logicians from other countries, who visited Japan in the summer of 1987.
International Nuclear Information System (INIS)
He, Jia; Qin, Weichao; Zhang, Xujia; Wen, Yang; Su, Limin; Zhao, Yuanhui
2013-01-01
Prediction of the biodegradability of organic pollutants is an ecologically desirable and economically feasible tool for estimating the environmental fate of chemicals. In this paper, linear and nonlinear relationships between biological oxygen demand (BOD) and molecular descriptors/fragments have been investigated for 1130 organic chemicals. Significant relationships have been observed between the simple molecular descriptors and %BOD for some homologous compounds, but not for the whole set of compounds. Electronic parameters, such as E HOMO and E LUMO , are the dominant factors affecting the biodegradability for some homologous chemicals. However, other descriptors, such as molecular weight, acid dissociation constant and polarity still have a significant impact on the biodegradation. The best global model for %BOD prediction is that developed from a chain-based fragmentation scheme. At the same time, the theoretical relationship between %BOD and molecular descriptors/fragments has been investigated, based on a first-order kinetic process. The %BOD is nonlinearly, rather than linearly, related to the descriptors. The coefficients of determination can be significantly improved by using nonlinear models for the homologous compounds and the whole data set. After analysing 1130 ready and not ready biodegradable compounds using 23 simple descriptors and various fragmentation schemes, it was revealed that biodegradation could be well predicted from a chain-based fragmentation scheme, a decision tree and a %BOD model. The models were capable of separating NRB and RB with an overall accuracy of 87.2%, 83.0% and 82.5%, respectively. The best classification model developed was a chain-based model but it used 155 fragments. The simplest model was a decision tree which only used 10 structural fragments. The effect of structures on the biodegradation has been analysed and the biodegradation pathway and mechanisms have been discussed based on activating and inactivating
Popular lectures on mathematical logic
Wang, Hao
2014-01-01
A noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. Author Hao Wang surveys the central concepts and theories of the discipline in a historical and developmental context, and then focuses on the four principal domains of contemporary mathematical logic: set theory, model theory, recursion theory and constructivism, and proof theory.Topics include the place of problems in the development of theories of logic and logic's relation to computer science. Specific attention is given to Gödel's incomplete
Classical Mathematical Logic The Semantic Foundations of Logic
Epstein, Richard L
2011-01-01
In Classical Mathematical Logic, Richard L. Epstein relates the systems of mathematical logic to their original motivations to formalize reasoning in mathematics. The book also shows how mathematical logic can be used to formalize particular systems of mathematics. It sets out the formalization not only of arithmetic, but also of group theory, field theory, and linear orderings. These lead to the formalization of the real numbers and Euclidean plane geometry. The scope and limitations of modern logic are made clear in these formalizations. The book provides detailed explanations of all proo
Conventions and Institutional Logics
DEFF Research Database (Denmark)
Westenholz, Ann
Two theoretical approaches – Conventions and Institutional Logics – are brought together and the similarities and differences between the two are explored. It is not the intention to combine the approaches, but I would like to open both ‘boxes’ and make them available to each other with the purpose...... of creating a space for dialog. Both approaches were developed in the mid-1980s as a reaction to rational-choice economic theory and collectivistic sociological theory. These two theories were oversimplifying social life as being founded either in actor-micro level analyses or in structure-macro level...... analyses. The theoretical quest of both Conventions and Institutional Logics has been to understand the increasing indeterminacy, uncertainty and ambiguity in people’s lives where a sense of reality, of value, of moral, of feelings is not fixed. Both approaches have created new theoretical insights...
Dialogues as a dynamic framework for logic
Rückert, Helge
2007-01-01
Dialogical logic is a game-theoretical approach to logic. Logic is studied with the help of certain games, which can be thought of as idealized argumentations. Two players, the Proponent, who puts forward the initial thesis and tries to defend it, and the Opponent, who tries to attack the
Logics of Business Education for Sustainability
Andersson, Pernilla; Öhman, Johan
2016-01-01
This paper explores various kinds of logics of "business education for sustainability" and how these "logics" position the subject business person, based on eight teachers' reasoning of their own practices. The concept of logics developed within a discourse theoretical framework is employed to analyse the teachers' reasoning.…
Acoustic logic gates and Boolean operation based on self-collimating acoustic beams
International Nuclear Information System (INIS)
Zhang, Ting; Xu, Jian-yi; Cheng, Ying; Liu, Xiao-jun; Guo, Jian-zhong
2015-01-01
The reveal of self-collimation effect in two-dimensional (2D) photonic or acoustic crystals has opened up possibilities for signal manipulation. In this paper, we have proposed acoustic logic gates based on the linear interference of self-collimated beams in 2D sonic crystals (SCs) with line-defects. The line defects on the diagonal of the 2D square SCs are actually functioning as a 3 dB splitter. By adjusting the phase difference between two input signals, the basic Boolean logic functions such as XOR, OR, AND, and NOT are achieved both theoretically and experimentally. Due to the non-diffracting property of self-collimation beams, more complex Boolean logic and algorithms such as NAND, NOR, and XNOR can be realized by cascading the basic logic gates. The achievement of acoustic logic gates and Boolean operation provides a promising approach for acoustic signal computing and manipulations
Gonzales, Leslie D.; Ayers, David F.
2018-01-01
Little empirical research has systematically focused on, or interrogated, the labor expectations set forth for community college faculty. Thus, in this paper, we present a theoretical argument, which we formed by (re) reading several community college focused studies through various theoretical lenses. Ultimately, we merged two…
Propositional Logics of Dependence
Yang, F.; Väänänen, J.
2016-01-01
In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well as propositional inquisitive logic, are expressively complete
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area.......Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area....
Smets, P
1995-01-01
We start by describing the nature of imperfect data, and giving an overview of the various models that have been proposed. Fuzzy sets theory is shown to be an extension of classical set theory, and as such has a proeminent role or modelling imperfect data. The mathematic of fuzzy sets theory is detailled, in particular the role of the triangular norms. The use of fuzzy sets theory in fuzzy logic and possibility theory,the nature of the generalized modus ponens and of the implication operator for approximate reasoning are analysed. The use of fuzzy logic is detailled for application oriented towards process control and database problems.
DEFF Research Database (Denmark)
Reynolds, John C.
2002-01-01
In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure. The simple imperative programming language is extended with commands (not...... with the inductive definition of predicates on abstract data structures, this extension permits the concise and flexible description of structures with controlled sharing. In this paper, we will survey the current development of this program logic, including extensions that permit unrestricted address arithmetic...
Flow Logic for Process Calculi
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Nielson, Flemming; Pilegaard, Henrik
2012-01-01
Flow Logic is an approach to statically determining the behavior of programs and processes. It borrows methods and techniques from Abstract Interpretation, Data Flow Analysis and Constraint Based Analysis while presenting the analysis in a style more reminiscent of Type Systems. Traditionally...... developed for programming languages, this article provides a tutorial development of the approach of Flow Logic for process calculi based on a decade of research. We first develop a simple analysis for the π-calculus; this consists of the specification, semantic soundness (in the form of subject reduction......, and finally, we extend it to a relational analysis. A Flow Logic is a program logic---in the same sense that a Hoare’s logic is. We conclude with an executive summary presenting the highlights of the approach from this perspective including a discussion of theoretical properties as well as implementation...
All-optical symmetric ternary logic gate
Chattopadhyay, Tanay
2010-09-01
Symmetric ternary number (radix=3) has three logical states (1¯, 0, 1). It is very much useful in carry free arithmetical operation. Beside this, the logical operation using this type of number system is also effective in high speed computation and communication in multi-valued logic. In this literature all-optical circuits for three basic symmetrical ternary logical operations (inversion, MIN and MAX) are proposed and described. Numerical simulation verifies the theoretical model. In this present scheme the different ternary logical states are represented by different polarized state of light. Terahertz optical asymmetric demultiplexer (TOAD) based interferometric switch has been used categorically in this manuscript.
Korzeniewski, Bernard; Zoladz, Jerzy A
2003-08-01
At low power output exercise (below lactate threshold), the oxygen uptake increases linearly with power output, but at high power output exercise (above lactate threshold) some additional oxygen consumption causes a non-linearity in the overall VO(2) (oxygen uptake rate)-power output relationship. The functional significance of this phenomenon for human exercise tolerance is very important, but the mechanisms underlying it remain unknown. In the present work, a computer model of oxidative phosphorylation in intact skeletal muscle developed previously is used to examine the background of this relationship in different modes of exercise. Our simulations demonstrate that the non-linearity in the VO(2)-power output relationship and the difference in the magnitude of this non-linearity between incremental exercise mode and square-wave exercise mode (constant power output exercise) can be generated by introducing into the model some hypothetical factor F (group of associated factors) that accumulate(s) in time during exercise. The performed computer simulations, based on this assumption, give proper time courses of changes in VO(2) and [PCr] after an onset of work of different intensities, including the slow component in VO(2), well matching the experimental results. Moreover, if it is assumed that the exercise terminates because of fatigue when the amount/intensity of F exceed some threshold value, the model allows the generation of a proper shape of the well-known power-duration curve. This fact suggests that the phenomenon of the non-linearity of the VO(2)-power output relationship and the magnitude of this non-linearity in different modes of exercise is determined by some factor(s) responsible for muscle fatigue.
Energy Technology Data Exchange (ETDEWEB)
Grohmann, Thomas
2012-05-31
In this thesis the wave packet dynamics of nuclear spin isomers of polyatomic molecules after interaction with static and time-dependent magnetic fields and moderate intense nonresonant laser pulses is investigated. In particular, the process of inducing (internal) molecular rotation as well as alignment of molecules by manipulating their rotational or rotational-torsional degrees of freedom is studied. In the first part of the thesis all theoretical concepts for identifying nuclear spin isomers and for describing their quantum dynamics will be discussed. Especially the symmetrization postulate and themolecular symmetry group will be introduced and illustrated for some examples of molecules. These concepts will be extended to the case of identifying nuclear spin isomers in the presence of an external field. In the second part it is shown for nitromethane that magnetic fields are able to induce unidirectional rotations in opposite directions for different nuclear spin isomers of molecules containing methyl groups if the dipolar interaction is included. Additionally, it is demonstrated that different nuclear spin isomers of a chemical compound may show different alignment after the interaction with a moderate intense laser pulse. As shown for the rigid symmetric top propadien and the rigid asymmetric tops ethene and analogues, distinct pairs of nuclear spin isomers show at certain points in time a complementary behavior: while one isomer is showing alignment the partner isomer is showing anti-alignment. Moreover, it is illustrated that not every nuclear spin isomer can be aligned equally efficient. The alignment of non-rigid molecules is considered as well. As an example for a molecule with feasible torsion in the electronic ground state, the alignment of diboron tetrafluoride is investigated. It becomes apparent that not only rotational but also the torsional dynamics of the molecules is nuclear spin selective; different nuclear spin isomers have at distinct points
DEFF Research Database (Denmark)
Friche, Nanna; Normann Andersen, Vibeke
unintended consequences. Theoretically, we draw on different management and governance theories, e.g. performance management. Empirically, the study is based on surveys to teachers and students at all Danish vocational colleges and interviews with school leaders, teachers and students at six colleges (cases...... and well-being of students enrolled in the VETs must be strengthened. We focus on target 1, 2 and 4. The reform is being implemented in a field of VET that can be characterized by four logics of governance. Firstly, a governance logic characterized by institutional independence of vocational colleges......For the last fifteen years completion rates in Danish vocational education and training (VET) has stayed on a rather low level. In 2014, only half of the students enrolled in a vocational program on upper secondary level, graduated from the program (Flarup et al 2016). In Denmark, like in other...
A functional language for describing reversible logic
DEFF Research Database (Denmark)
Thomsen, Michael Kirkedal
2012-01-01
Reversible logic is a computational model where all gates are logically reversible and combined in circuits such that no values are lost or duplicated. This paper presents a novel functional language that is designed to describe only reversible logic circuits. The language includes high....... Reversibility of descriptions is guaranteed with a type system based on linear types. The language is applied to three examples of reversible computations (ALU, linear cosine transformation, and binary adder). The paper also outlines a design flow that ensures garbage- free translation to reversible logic...... circuits. The flow relies on a reversible combinator language as an intermediate language....
Enriching an effect calculus with linear types
DEFF Research Database (Denmark)
Egger, Jeff; Møgelberg, Rasmus Ejlers; Simpson, Alex
2009-01-01
We define an ``enriched effect calculus'' by conservatively extending a type theory for computational effects with primitives from linear logic. By doing so, we obtain a generalisation of linear type theory, intended as a formalism for expressing linear aspects of effects. As a worked example, we...... formulate linearly-used continuations in the enriched effect calculus. These are captured by a fundamental translation of the enriched effect calculus into itself, which extends existing call-by-value and call-by-name linearly-used CPS translations. We show that our translation is involutive. Full...... completeness results for the various linearly-used CPS translations follow. Our main results, the conservativity of enriching the effect calculus with linear primitives, and the involution property of the fundamental translation, are proved using a category-theoretic semantics for the enriched effect calculus...
Energy Technology Data Exchange (ETDEWEB)
Singh, Rishi Pal [Department of Physics, Banaras Hindu University, Varanasi 221005 (India); Singh, Rajendra Kumar, E-mail: rksingh_17@rediffmail.com [Department of Physics, Banaras Hindu University, Varanasi 221005 (India)
2010-11-01
Temperature dependence of acoustic attenuation and non-linearity parameters in lithium hydride and lithium deuteride have been studied for longitudinal and shear modes along various crystallographic directions of propagation in a wide temperature range. Lattice parameter and repulsive parameters have been used as input data and interactions up to next nearest neighbours have been considered to calculate second and third order elastic constants which in turn have been used for evaluating acoustic attenuation and related parameters. The results have been discussed and compared with available data. It is hoped that the present results will serve to stimulate the determination of the acoustic attenuation of these compounds at different temperatures.
International Nuclear Information System (INIS)
Lazarev, N. V.
2006-01-01
These memoirs are devoted to the Institute's anniversary and present the history of the Linear Accelerator Department at ITEP. Some studies are described in which I was involved. During more than 40 years. I worked with Professor I.M. Kapchinsky (1919-1993), a world-renowned scientist, the founder of the department. References are given to Kapchinsky's monographs and to some of the works that were performed under his supervision and were published in proceedings of accelerator conferences. Many active scientists, engineers, and technicians are mentioned who participate in the achievements of the department, which made a significant contribution to the development of accelerator science and engineering in Russia and worldwide
On the Predictability of Classical Propositional Logic
Finger, Marcelo; Reis, Poliana
2013-01-01
In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction, that opposes considering Boolean Logic as trivial in any sense. For that, we study the predictability of classical logic, which we take to be the distribution of the runtime of its decision process. We present a series of experiments that det...
International Nuclear Information System (INIS)
Mittelstaedt, P.
1979-01-01
The subspaces of Hilbert space constitute an orthocomplemented quasimodular lattice Lsub(q) for which neither a two-valued function nor generalized truth function exist. A generalisation of the dialogic method can be used as an interpretation of a lattice Lsub(qi), which may be considered as the intuitionistic part of Lsub(q). Some obvious modifications of the dialogic method are introduced which come from the possible incommensurability of propositions about quantum mechanical systems. With the aid of this generalized dialogic method a propositional calculus Qsub(eff) is derived which is similar to the calculus of effective (intuitionistic) logic, but contains a few restrictions which are based on the incommensurability of quantum mechanical propositions. It can be shown within the framework of the calculus Qsub(eff) that the value-definiteness of the elementary propositions which are proved by quantum mechanical propositions is inherited by all finite compund propositions. In this way one arrives at the calculus Q of full quantum logic which incorporates the principle of excluded middle for all propositions and which is a model for the lattice Lsub(q). (Auth.)
Logic regression and its extensions.
Schwender, Holger; Ruczinski, Ingo
2010-01-01
Logic regression is an adaptive classification and regression procedure, initially developed to reveal interacting single nucleotide polymorphisms (SNPs) in genetic association studies. In general, this approach can be used in any setting with binary predictors, when the interaction of these covariates is of primary interest. Logic regression searches for Boolean (logic) combinations of binary variables that best explain the variability in the outcome variable, and thus, reveals variables and interactions that are associated with the response and/or have predictive capabilities. The logic expressions are embedded in a generalized linear regression framework, and thus, logic regression can handle a variety of outcome types, such as binary responses in case-control studies, numeric responses, and time-to-event data. In this chapter, we provide an introduction to the logic regression methodology, list some applications in public health and medicine, and summarize some of the direct extensions and modifications of logic regression that have been proposed in the literature. Copyright © 2010 Elsevier Inc. All rights reserved.
Mainaud Durand, H; Chritin, N; Griffet, S; Kemppinen, J; Sosin, M; Touze, T
2011-01-01
The active pre-alignment of the Compact Linear Collider (CLIC) is one of the key points of the project: the components must be pre-aligned w.r.t. a straight line within a few microns over a sliding window of 200 m, along the two linacs of 20 km each. The proposed solution consists of stretched wires of more than 200 m, overlapping over half of their length, which will be the reference of alignment. Wire Positioning Sensors (WPS), coupled to the supports to be pre-aligned, will perform precise and accurate measurements within a few microns w.r.t. these wires. A micrometric fiducialisation of the components and a micrometric alignment of the components on common supports will make the strategy of pre-alignment complete. In this paper, the global strategy of active pre-alignment is detailed and illustrated by the latest results demonstrating the feasibility of the proposed solution.
Hamkins, J.D.; Löwe, B.
2008-01-01
A set theoretical assertion psi is forceable or possible, written lozenge psi, if psi holds in some forcing extension, and necessary, written square psi, if psi holds in all forcing extensions. In this forcing interpretation of modal logic, we establish that if ZFC is consistent, then the
Carlton, David Bryan
The exponential improvements in speed, energy efficiency, and cost that the computer industry has relied on for growth during the last 50 years are in danger of ending within the decade. These improvements all have relied on scaling the size of the silicon-based transistor that is at the heart of every modern CPU down to smaller and smaller length scales. However, as the size of the transistor reaches scales that are measured in the number of atoms that make it up, it is clear that this scaling cannot continue forever. As a result of this, there has been a great deal of research effort directed at the search for the next device that will continue to power the growth of the computer industry. However, due to the billions of dollars of investment that conventional silicon transistors have received over the years, it is unlikely that a technology will emerge that will be able to beat it outright in every performance category. More likely, different devices will possess advantages over conventional transistors for certain applications and uses. One of these emerging computing platforms is nanomagnetic logic (NML). NML-based circuits process information by manipulating the magnetization states of single-domain nanomagnets coupled to their nearest neighbors through magnetic dipole interactions. The state variable is magnetization direction and computations can take place without passing an electric current. This makes them extremely attractive as a replacement for conventional transistor-based computing architectures for certain ultra-low power applications. In most work to date, nanomagnetic logic circuits have used an external magnetic clocking field to reset the system between computations. The clocking field is then subsequently removed very slowly relative to the magnetization dynamics, guiding the nanomagnetic logic circuit adiabatically into its magnetic ground state. In this dissertation, I will discuss the dynamics behind this process and show that it is greatly
Payton, Spencer D.
2017-01-01
This study aimed to explore how inquiry-oriented teaching could be implemented in an introductory linear algebra course that, due to various constraints, may not lend itself to inquiry-oriented teaching. In particular, the course in question has a traditionally large class size, limited amount of class time, and is often coordinated with other…
DEFF Research Database (Denmark)
Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume...... is the proceedings of the conference of record in its fi eld, Advances in Modal Logic. Its contributions are state-of-the-art papers. The topics include decidability and complexity results for specifi c modal logics, proof theory of modal logic, logics for reasoning about time and space, provability logic, dynamic...... epistemic logic, and the logic of evidence....
Reachability modules for the description logic SRIQ
CSIR Research Space (South Africa)
Nortje, R
2013-12-01
Full Text Available In this paper we investigate module extraction for the Description Logic SRIQ. We formulate modules in terms of the reachability problem for directed hypergraphs. Using inseperability relations, we investigate the module-theoretic properties...
Stoll, R R
1968-01-01
Linear Algebra is intended to be used as a text for a one-semester course in linear algebra at the undergraduate level. The treatment of the subject will be both useful to students of mathematics and those interested primarily in applications of the theory. The major prerequisite for mastering the material is the readiness of the student to reason abstractly. Specifically, this calls for an understanding of the fact that axioms are assumptions and that theorems are logical consequences of one or more axioms. Familiarity with calculus and linear differential equations is required for understand
Bohrification of operator algebras and quantum logic
Heunen, C.; Landsman, N.P.; Spitters, B.A.W.
2012-01-01
Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by
Bohrification of operator algebras and quantum logic
Heunen, C.; Landsman, N.P.; Spitters, B.A.W.
2009-01-01
Following Birkhoff and von Neumann, quantum logic has traditionally been based on the lattice of closed linear subspaces of some Hilbert space, or, more generally, on the lattice of projections in a von Neumann algebra A. Unfortunately, the logical interpretation of these lattices is impaired by
Energy Technology Data Exchange (ETDEWEB)
Zia, Haider
2015-12-15
Compact and stable ultrafast laser sources for electron diffraction experiments are the first step in accomplishing the dream experiment of producing a molecular movie. This thesis work focuses on developing new robust laser sources to enable arbitrary scaling in laser repetition rate, pulse energy, duration and stability as needed to provide sufficient integrated detected electrons for high quality diffraction patterns that can be inverted to real space movies. In chapter 2, the construction of a novel stable and high power stretched pulse fiber oscillator outputting 300 mW at 31 MHz and compressible pulses to below 90 fs will be described. Chapter 3 describes the construction of a solid-state regenerative amplifier that was developed to achieve pulse energies above 1mJ with 0.40 mJ already achieved at 1 kHz. Novel simulation techniques were explored that aided the construction of the amplifier. Chapter 4 derives a new, fast and powerful numerical theory that is implemented for generalized non-linear Schrodinger equations in all spatial dimensions and time. This new method can model complicated terms in these equations that outperforms other numerical methods with respect to minimizing numerical error and increased speed. These advantages are due to this method's Fourier nature. A simulation tool was created, employing this numerical technique to simulate white-light generation in bulk media. The simulation matches extremely well with published experimental data, and is superior to the original simulation method used to match the experiment. The use of this tool enables accurate calculations of continuum or white light generation as needed for different experimental protocols and serves as the primary input to generate wide bandwidth coherent light.This work has solved the problem of predictably designing continuum generation within targeted wavelength ranges. This information is needed as part of an overall scheme in laser source development to coherently
International Nuclear Information System (INIS)
Zia, Haider
2015-12-01
Compact and stable ultrafast laser sources for electron diffraction experiments are the first step in accomplishing the dream experiment of producing a molecular movie. This thesis work focuses on developing new robust laser sources to enable arbitrary scaling in laser repetition rate, pulse energy, duration and stability as needed to provide sufficient integrated detected electrons for high quality diffraction patterns that can be inverted to real space movies. In chapter 2, the construction of a novel stable and high power stretched pulse fiber oscillator outputting 300 mW at 31 MHz and compressible pulses to below 90 fs will be described. Chapter 3 describes the construction of a solid-state regenerative amplifier that was developed to achieve pulse energies above 1mJ with 0.40 mJ already achieved at 1 kHz. Novel simulation techniques were explored that aided the construction of the amplifier. Chapter 4 derives a new, fast and powerful numerical theory that is implemented for generalized non-linear Schrodinger equations in all spatial dimensions and time. This new method can model complicated terms in these equations that outperforms other numerical methods with respect to minimizing numerical error and increased speed. These advantages are due to this method's Fourier nature. A simulation tool was created, employing this numerical technique to simulate white-light generation in bulk media. The simulation matches extremely well with published experimental data, and is superior to the original simulation method used to match the experiment. The use of this tool enables accurate calculations of continuum or white light generation as needed for different experimental protocols and serves as the primary input to generate wide bandwidth coherent light.This work has solved the problem of predictably designing continuum generation within targeted wavelength ranges. This information is needed as part of an overall scheme in laser source development to coherently
Paraconsistent Computational Logic
DEFF Research Database (Denmark)
Jensen, Andreas Schmidt; Villadsen, Jørgen
2012-01-01
In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....
Doberkat, Ernst-Erich
2009-01-01
Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles of coalgebraic logic from a categorical perspective. Modal logics are also discussed, including probabilistic interpretations and an analysis of Kripke models.
Classical logic and logicism in human thought
Elqayam, Shira
2012-01-01
This chapter explores the role of classical logic as a theory of human reasoning. I distinguish between classical logic as a normative, computational and algorithmic system, and review its role is theories of human reasoning since the 1960s. The thesis I defend is that psychological theories have been moving further and further away from classical logic on all three levels. I examine some prominent example of logicist theories, which incorporate logic in their psychological account, includin...
Logic programming extensions of Horn clause logic
Directory of Open Access Journals (Sweden)
Ron Sigal
1988-11-01
Full Text Available Logic programming is now firmly established as an alternative programming paradigm, distinct and arguably superior to the still dominant imperative style of, for instance, the Algol family of languages. The concept of a logic programming language is not precisely defined, but it is generally understood to be characterized buy: a declarative nature; foundation in some well understood logical system, e.g., first order logic.
Three-valued logics in modal logic
Kooi, Barteld; Tamminga, Allard
2013-01-01
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we
Fuzzy logic of Aristotelian forms
Energy Technology Data Exchange (ETDEWEB)
Perlovsky, L.I. [Nichols Research Corp., Lexington, MA (United States)
1996-12-31
Model-based approaches to pattern recognition and machine vision have been proposed to overcome the exorbitant training requirements of earlier computational paradigms. However, uncertainties in data were found to lead to a combinatorial explosion of the computational complexity. This issue is related here to the roles of a priori knowledge vs. adaptive learning. What is the a-priori knowledge representation that supports learning? I introduce Modeling Field Theory (MFT), a model-based neural network whose adaptive learning is based on a priori models. These models combine deterministic, fuzzy, and statistical aspects to account for a priori knowledge, its fuzzy nature, and data uncertainties. In the process of learning, a priori fuzzy concepts converge to crisp or probabilistic concepts. The MFT is a convergent dynamical system of only linear computational complexity. Fuzzy logic turns out to be essential for reducing the combinatorial complexity to linear one. I will discuss the relationship of the new computational paradigm to two theories due to Aristotle: theory of Forms and logic. While theory of Forms argued that the mind cannot be based on ready-made a priori concepts, Aristotelian logic operated with just such concepts. I discuss an interpretation of MFT suggesting that its fuzzy logic, combining a-priority and adaptivity, implements Aristotelian theory of Forms (theory of mind). Thus, 2300 years after Aristotle, a logic is developed suitable for his theory of mind.
A functorial semantics for quantum logic
International Nuclear Information System (INIS)
Holdsworth, D.G.
1979-09-01
The author uses category theory to examine a quantum logical interpretation of quantum theory. The central thesis is that logical structure is an objective feature of reality, not merely a feature of representation of reality inherent in particular theories. A non-classical foundation for mathematics is adopted, one that uses morphisms as its primitives. The author argues that all propositions in a physical theory are theoretical and that observation statements constitute a subclass of theoretical statements. Inferences to micro- and macro-objects are on the same pragmatic and logical level, and defending realism for quantum theory involves providing a new criterion of objectivity that coheres with the general constraints of the theory. The criterion proposed has the consequence that certain structural features of reality are to be considered theoretically determined or objective. These features are closely related to logical structure
Heunen, Chris
2008-01-01
We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is just an incarnation of categorical logic, enabling us to establish an existential quantifier for quantum logic, and conclude that there cannot be a universal quantifier.
Directory of Open Access Journals (Sweden)
Iryna Khomenko
2018-04-01
Full Text Available The challenges of the global time require new solutions and up-to-date ways of thinking and communication. These challenges call for the ability to use critical thinking to face the ever-changing world and the ability to maintain a dialog based on the effective skills of communication. Studies in the fields of logic and argumentation theory are of particular importance in this regard. Nowadays they can be presented as a mix of theoretical and practical approaches. In this paper, I will present my reflections on informal logic, which was formed in the late 1970s. Unfortunately, in spite of numerous papers, books, and text-books published over the last forty years, consensus on many issues in this field has not been achieved so far. Therefore, it is difficult to treat informal logic as one of the well-defined approaches to argumentation. The goal of this paper is to take a look at the place of informal logic in state-of-the art study of argumentation by clarifying its subject matter and figuring out the realm to which informal logic belongs.
Metamathematics of fuzzy logic
Hájek, Petr
1998-01-01
This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. Some important systems of real-valued propositional and predicate calculus are defined and investigated. The aim is to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named `fuzzy inference' can be naturally understood as logical deduction.
Berg Johansen, Christina; Bock Waldorff, Susanne
2015-01-01
This study presents new insights into the explanatory power of the institutional logics perspective. With outset in a discussion of seminal theory texts, we identify two fundamental topics that frame institutional logics: overarching institutional orders guided by institutional logics, as well as change and agency generated by friction between logics. We use these topics as basis for an analysis of selected empirical papers, with the aim of understanding how institutional logics contribute to...
Linearization Method and Linear Complexity
Tanaka, Hidema
We focus on the relationship between the linearization method and linear complexity and show that the linearization method is another effective technique for calculating linear complexity. We analyze its effectiveness by comparing with the logic circuit method. We compare the relevant conditions and necessary computational cost with those of the Berlekamp-Massey algorithm and the Games-Chan algorithm. The significant property of a linearization method is that it needs no output sequence from a pseudo-random number generator (PRNG) because it calculates linear complexity using the algebraic expression of its algorithm. When a PRNG has n [bit] stages (registers or internal states), the necessary computational cost is smaller than O(2n). On the other hand, the Berlekamp-Massey algorithm needs O(N2) where N(≅2n) denotes period. Since existing methods calculate using the output sequence, an initial value of PRNG influences a resultant value of linear complexity. Therefore, a linear complexity is generally given as an estimate value. On the other hand, a linearization method calculates from an algorithm of PRNG, it can determine the lower bound of linear complexity.
Connections among quantum logics
International Nuclear Information System (INIS)
Lock, P.F.; Hardegree, G.M.
1985-01-01
In this paper, a theory of quantum logics is proposed which is general enough to enable us to reexamine a previous work on quantum logics in the context of this theory. It is then easy to assess the differences between the different systems studied. The quantum logical systems which are incorporated are divided into two groups which we call ''quantum propositional logics'' and ''quantum event logics''. The work of Kochen and Specker (partial Boolean algebras) is included and so is that of Greechie and Gudder (orthomodular partially ordered sets), Domotar (quantum mechanical systems), and Foulis and Randall (operational logics) in quantum propositional logics; and Abbott (semi-Boolean algebras) and Foulis and Randall (manuals) in quantum event logics, In this part of the paper, an axiom system for quantum propositional logics is developed and the above structures in the context of this system examined. (author)
Cleaveland, Rance; Luettgen, Gerald; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, LPC extends Milner's Calculus of Communicating Systems with operators from the alternation-free linear-time mu-calculus (LT(mu)). Semantically, LPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must-testing preorder as well as LT(mu's) satisfaction relation, while being compositional for all LPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of: (1) both minimal and maximal fixed-point operators and (2) an unimple-mentability predicate on process terms, which tags inconsistent specifications. The utility of LPC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification.
Yan, Shengjie; Wu, Xiaomei; Wang, Weiqi
2017-09-01
Radiofrequency (RF) energy is often used to create a linear lesion or discrete lesions for blocking the accessory conduction pathways for treating atrial fibrillation. By using finite element analysis, we study the ablation effect of amplitude control ablation mode (AcM) and bipolar ablation mode (BiM) in creating a linear lesion and discrete lesions in a 5-mm-thick atrial wall; particularly, the characteristic of lesion shape has been investigated in amplitude control ablation. Computer models of multipolar catheter were developed to study the lesion dimensions in atrial walls created through AcM, BiM and special electrodes activated ablation methods in AcM and BiM. To validate the theoretical results in this study, an in vitro experiment with porcine cardiac tissue was performed. At 40 V/20 V root mean squared (RMS) of the RF voltage for AcM, the continuous and transmural lesion was created by AcM-15s, AcM-5s and AcM-ad-20V ablation in 5-mm-thick atrial wall. At 20 V RMS for BiM, the continuous but not transmural lesion was created. AcM ablation yielded asymmetrical and discrete lesions shape, whereas the lesion shape turned to more symmetrical and continuous as the electrodes alternative activated period decreased from 15 s to 5 s. Two discrete lesions were created when using AcM, AcM-ad-40V, BiM-ad-20V and BiM-ad-40V. The experimental and computational thermal lesion shapes created in cardiac tissue were in agreement. Amplitude control ablation technology and bipolar ablation technology are feasible methods to create continuous lesion or discrete for pulmonary veins isolation.
DEFF Research Database (Denmark)
Schürmann, Carsten; Sarnat, Jeffrey
2008-01-01
Tait's method (a.k.a. proof by logical relations) is a powerful proof technique frequently used for showing foundational properties of languages based on typed lambda-calculi. Historically, these proofs have been extremely difficult to formalize in proof assistants with weak meta-logics......, such as Twelf, and yet they are often straightforward in proof assistants with stronger meta-logics. In this paper, we propose structural logical relations as a technique for conducting these proofs in systems with limited meta-logical strength by explicitly representing and reasoning about an auxiliary logic...
DEFF Research Database (Denmark)
Berg Johansen, Christina; Waldorff, Susanne Boch
This study presents new insights into the explanatory power of the institutional logics perspective. With outset in a discussion of seminal theory texts, we identify two fundamental topics that frame institutional logics: overarching institutional orders guides by institutional logics, as well...... as change and agency generated by friction between logics. We use these topics as basis for an analysis of selected empirical papers, with the aim of understanding how institutional logics contribute to institutional theory at large, and which social matters institutional logics can and cannot explore...
Indeterministic Temporal Logic
Directory of Open Access Journals (Sweden)
Trzęsicki Kazimierz
2015-09-01
Full Text Available The questions od determinism, causality, and freedom have been the main philosophical problems debated since the beginning of temporal logic. The issue of the logical value of sentences about the future was stated by Aristotle in the famous tomorrow sea-battle passage. The question has inspired Łukasiewicz’s idea of many-valued logics and was a motive of A. N. Prior’s considerations about the logic of tenses. In the scheme of temporal logic there are different solutions to the problem. In the paper we consider indeterministic temporal logic based on the idea of temporal worlds and the relation of accessibility between them.
Quantum Logic as a Dynamic Logic
Baltag, A.; Smets, S.
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear “no”.
Quantum logic as a dynamic logic
Baltag, Alexandru; Smets, Sonja
We address the old question whether a logical understanding of Quantum Mechanics requires abandoning some of the principles of classical logic. Against Putnam and others (Among whom we may count or not E. W. Beth, depending on how we interpret some of his statements), our answer is a clear "no".
Transforming equality logic to propositional logic
Zantema, H.; Groote, J.F.
2003-01-01
Abstract We investigate and compare various ways of transforming equality formulas to propositional formulas, in order to be able to solve satisfiability in equality logic by means of satisfiability in propositional logic. We propose equality substitution as a new approach combining desirable
Admissible Rules of Lukasiewicz Logic
Czech Academy of Sciences Publication Activity Database
Jeřábek, Emil
2010-01-01
Roč. 20, č. 2 (2010), s. 425-447 ISSN 0955-792X R&D Projects: GA AV ČR IAA900090703; GA AV ČR IAA100190902; GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10190503 Keywords : linear temporal logic * unification * consecutions Subject RIV: BA - General Mathematics Impact factor: 0.586, year: 2010 http://logcom.oxfordjournals.org/content/20/2/425
Session Types in Abelian Logic
Directory of Open Access Journals (Sweden)
Yoichi Hirai
2013-12-01
Full Text Available There was a PhD student who says "I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes." We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky's linear lambda calculus LF and characterizes Abelian logic.
Graded Alternating-Time Temporal Logic
Faella, Marco; Napoli, Margherita; Parente, Mimmo
Graded modalities enrich the universal and existential quantifiers with the capability to express the concept of at least k or all but k, for a non-negative integer k. Recently, temporal logics such as μ-calculus and Computational Tree Logic, Ctl, augmented with graded modalities have received attention from the scientific community, both from a theoretical side and from an applicative perspective. Both μ-calculus and Ctl naturally apply as specification languages for closed systems: in this paper, we add graded modalities to the Alternating-time Temporal Logic (Atl) introduced by Alur et al., to study how these modalities may affect specification languages for open systems.
Bolc, Leonard
1992-01-01
Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of excluded middle" in classical logic. The first many-valued formal systems were developed by J. Lukasiewicz in Poland and E.Post in the U.S.A. in the 1920s, and since then the field has expanded dramatically as the applicability of the systems to other philosophical and semantic problems was recognized. Intuitionisticlogic, for example, arose from deep problems in the foundations of mathematics. Fuzzy logics, approximation logics, and probability logics all address questions that classical logic alone cannot answer. All these interpretations of many-valued calculi motivate specific formal systems thatallow detailed mathematical treatment. In this volume, the authors are concerned with finite-valued logics, and especially with three-valued logical calculi. Matrix constructions, axiomatizations of propositional and predicate calculi, syntax, semantic structures, and methodology are discussed. Separate chapters deal w...
Directory of Open Access Journals (Sweden)
P N Johnson-Laird
2010-10-01
Full Text Available An old view in logic going back to Aristotle is that an inference is valid in virtue of its logical form. Many psychologists have adopted the same point of view about human reasoning: the first step is to recover the logical form of an inference, and the second step is to apply rules of inference that match these forms in order to prove that the conclusion follows from the premises. The present paper argues against this idea. The logical form of an inference transcends the grammatical forms of the sentences used to express it, because logical form also depends on context. Context is not readily expressed in additional premises. And the recovery of logical form leads ineluctably to the need for infinitely many axioms to capture the logical properties of relations. An alternative theory is that reasoning depends on mental models, and this theory obviates the need to recover logical form.
Newton-Smith, WH
2003-01-01
A complete introduction to logic for first-year university students with no background in logic, philosophy or mathematics. In easily understood steps it shows the mechanics of the formal analysis of arguments.
Anticoincidence logic using PALs
International Nuclear Information System (INIS)
Bolanos, L.; Arista Romeu, E.
1997-01-01
This paper describes the functioning principle of an anticoincidence logic and a design of this based on programing logic. The circuit was included in a discriminator of an equipment for single-photon absorptiometry
Manipulating potential wells in Logical Stochastic Resonance to obtain XOR logic
International Nuclear Information System (INIS)
Storni, Remo; Ando, Hiroyasu; Aihara, Kazuyuki; Murali, K.; Sinha, Sudeshna
2012-01-01
Logical Stochastic Resonance (LSR) is the application of Stochastic Resonance to logic computation, namely the phenomenon where a nonlinear system driven by weak signals representing logic inputs, under optimal noise, can yield logic outputs. We extend the existing results, obtained in the context of bistable systems, to multi-stable dynamical systems, allowing us to obtain XOR logic, in addition to the AND (NAND) and OR (NOR) logic observed in earlier studies. This strategy widens the scope of LSR from the application point of view, as XOR forms the basis of ubiquitous bit-by-bit addition, and conceptually, showing the ability to yield non-monotonic input–output logic associations. -- Highlights: ► We generalize Logical Stochastic Resonance from bistable to multi-stable systems. ► We propose a tristable dynamical system formed of piecewise linear functions. ► The system can correctly reproduce XOR logic behavior using the LSR principle. ► The system yields different logic behavior without the need to change the dynamics.
Connections among quantum logics
International Nuclear Information System (INIS)
Lock, P.F.; Hardegree, G.M.
1985-01-01
This paper gives a brief introduction to the major areas of work in quantum event logics: manuals (Foulis and Randall) and semi-Boolean algebras (Abbott). The two theories are compared, and the connection between quantum event logics and quantum propositional logics is made explicit. In addition, the work on manuals provides us with many examples of results stated in Part I. (author)
Manca, V.; Salibra, A.; Scollo, Giuseppe
1990-01-01
Equational type logic is an extension of (conditional) equational logic, that enables one to deal in a single, unified framework with diverse phenomena such as partiality, type polymorphism and dependent types. In this logic, terms may denote types as well as elements, and atomic formulae are either
DEFF Research Database (Denmark)
Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian
2015-01-01
We introduce Concurrent Weighted Logic (CWL), a multimodal logic for concurrent labeled weighted transition systems (LWSs). The synchronization of LWSs is described using dedicated functions that, in various concurrency paradigms, allow us to encode the compositionality of LWSs. To reflect these......-completeness results for this logic. To complete these proofs we involve advanced topological techniques from Model Theory....
Bergstra, J.A.
2011-01-01
Four options for assigning a meaning to Islamic Logic are surveyed including a new proposal for an option named "Real Islamic Logic" (RIL). That approach to Islamic Logic should serve modern Islamic objectives in a way comparable to the functionality of Islamic Finance. The prospective role of RIL
DEFF Research Database (Denmark)
Christiansen, Henning; Dahl, Veronica
2009-01-01
By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting....... We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also -- in a significant departure from...
DEFF Research Database (Denmark)
Bentzen, Martin Mose
2014-01-01
A new deontic logic, Action Type Deontic Logic, is presented. To motivate this logic, a number of benchmark cases are shown, representing inferences a deontic logic should validate. Some of the benchmark cases are singled out for further comments and some formal approaches to deontic reasoning...... are evaluated with respect to the benchmark cases. After that follows an informal introduction to the ideas behind the formal semantics, focussing on the distinction between action types and action tokens. Then the syntax and semantics of Action Type Deontic Logic is presented and it is shown to meet...
Czech Academy of Sciences Publication Activity Database
Horčík, Rostislav; Cintula, Petr
2004-01-01
Roč. 43, - (2004), s. 477-503 ISSN 1432-0665 R&D Projects: GA AV ČR IAA1030004; GA ČR GA201/02/1540 Grant - others:GA CTU(CZ) project 0208613; net CEEPUS(SK) SK-042 Institutional research plan: CEZ:AV0Z1030915 Keywords : fuzzy logic * many-valued logic * Lukasiewicz logic * Lpi logic * Takeuti-Titani logic * MV-algebras * product MV-algebras Subject RIV: BA - General Mathematics Impact factor: 0.295, year: 2004
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Huertas, Antonia; Manzano, Maria
2014-01-01
Leon Henkin was not a modal logician, but there is a branch of modal logic that has been deeply influenced by his work. That branch is hybrid logic, a family of logics that extend orthodox modal logic with special proposition symbols (called nominals) that name worlds. This paper explains why...... Henkin’s techniques are so important in hybrid logic. We do so by proving a completeness result for a hybrid type theory called HTT, probably the strongest hybrid logic that has yet been explored. Our completeness result builds on earlier work with a system called BHTT, or basic hybrid type theory...... is due to the first-order perspective, which lies at the heart of Henin’s best known work and hybrid logic....
Directory of Open Access Journals (Sweden)
Newton C. A. da Costa
2002-12-01
Full Text Available In view of the present state of development of non classical logic, especially of paraconsistent logic, a new stand regarding the relations between logic and ontology is defended In a parody of a dictum of Quine, my stand May be summarized as follows. To be is to be the value of a variable a specific language with a given underlying logic Yet my stand differs from Quine’s, because, among other reasons, I accept some first order heterodox logics as genuine alternatives to classical logic I also discuss some questions of non classical logic to substantiate my argument, and suggest that may position complements and extends some ideas advanced by L Apostel.
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
Gore, Rajeev; Postniece, Linda; Tiu, Alwen
2010-01-01
We consider an extension of bi-intuitionistic logic with the traditional modalities from tense logic Kt. Proof theoretically, this extension is obtained simply by extending an existing sequent calculus for bi-intuitionistic logic with typical inference rules for the modalities used in display logics. As it turns out, the resulting calculus, LBiKt, seems to be more basic than most intuitionistic tense or modal logics considered in the literature, in particular, those studied by Ewald and Simps...
The Immateriality of Material Practices in Institutional Logics
DEFF Research Database (Denmark)
Jones, Candace; Boxenbaum, Eva; Anthony, Callen
2013-01-01
as practices and structures, and rarely as physical objects. We explore some consequences of omitting physical materials as an object of study in institutional logics research and point to avenues for future research that may enhance theory development of institutional logics by explicitly attending......According to most theoretical formulations, institutional logics contain both an ideational and a material dimension. Whereas the ideational aspect, such as cognitive frames and symbols, has received significant attention in the growing literature on institutional logics, the material aspect has...... remained largely invisible and often implicit. We analyze the 16 most central theoretical and empirical works on institutional logics with the aim of exploring how the material dimension of logics has been conceptualized and researched. Our findings suggest that materiality has been interpreted primarily...
Bipolar spintronics: from spin injection to spin-controlled logic
International Nuclear Information System (INIS)
Zutic, Igor; Fabian, Jaroslav; Erwin, Steven C
2007-01-01
An impressive success of spintronic applications has been typically realized in metal-based structures which utilize magnetoresistive effects for substantial improvements in the performance of computer hard drives and magnetic random access memories. Correspondingly, the theoretical understanding of spin-polarized transport is usually limited to a metallic regime in a linear response, which, while providing a good description for data storage and magnetic memory devices, is not sufficient for signal processing and digital logic. In contrast, much less is known about possible applications of semiconductor-based spintronics and spin-polarized transport in related structures which could utilize strong intrinsic nonlinearities in current-voltage characteristics to implement spin-based logic. Here we discuss the challenges for realizing a particular class of structures in semiconductor spintronics: our proposal for bipolar spintronic devices in which carriers of both polarities (electrons and holes) contribute to spin-charge coupling. We formulate the theoretical framework for bipolar spin-polarized transport, and describe several novel effects in two- and three-terminal structures which arise from the interplay between nonequilibrium spin and equilibrium magnetization
New data structures and algorithms for logic synthesis and verification
Amaru, Luca Gaetano
2017-01-01
This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, in order to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The author discusses techniques that improve the efficiency of logic representation, manipulation and optimization tasks by taking advantage of majority and biconditional logic primitives. Readers will be enabled to accelerate formal methods by studying core properties of logic circuits and developing new frameworks for logic reasoning engines. · Provides a comprehensive, theoretical study on majority and biconditional logic for logic synthesis; · Updates the current scenario in synthesis and verification – especially in light of emerging technologies; · Demonstrates applications to CMOS technology and emerging technologies.
Logic, mathematics, and computer science modern foundations with practical applications
Nievergelt, Yves
2015-01-01
This text for the first or second year undergraduate in mathematics, logic, computer science, or social sciences, introduces the reader to logic, proofs, sets, and number theory. It also serves as an excellent independent study reference and resource for instructors. Adapted from Foundations of Logic and Mathematics: Applications to Science and Cryptography © 2002 Birkhӓuser, this second edition provides a modern introduction to the foundations of logic, mathematics, and computers science, developing the theory that demonstrates construction of all mathematics and theoretical computer science from logic and set theory. The focus is on foundations, with specific statements of all the associated axioms and rules of logic and set theory, and provides complete details and derivations of formal proofs. Copious references to literature that document historical development is also provided. Answers are found to many questions that usually remain unanswered: Why is the truth table for logical implication so uni...
Dalen, Dirk
1983-01-01
A book which efficiently presents the basics of propositional and predicate logic, van Dalen’s popular textbook contains a complete treatment of elementary classical logic, using Gentzen’s Natural Deduction. Propositional and predicate logic are treated in separate chapters in a leisured but precise way. Chapter Three presents the basic facts of model theory, e.g. compactness, Skolem-Löwenheim, elementary equivalence, non-standard models, quantifier elimination, and Skolem functions. The discussion of classical logic is rounded off with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, one chapter is devoted to intuitionistic logic. Completeness is established for Kripke semantics. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property have been incorporated. The power and elegance of natural deduction is demonstrated best in the part of proof theory cal...
Directory of Open Access Journals (Sweden)
Schang Fabien
2017-03-01
Full Text Available An analogy is made between two rather different domains, namely: logic, and football (or soccer. Starting from a comparative table between the two activities, an alternative explanation of logic is given in terms of players, ball, goal, and the like. Our main thesis is that, just as the task of logic is preserving truth from premises to the conclusion, footballers strive to keep the ball as far as possible until the opposite goal. Assuming this analogy may help think about logic in the same way as in dialogical logic, but it should also present truth-values in an alternative sense of speech-acts occurring in a dialogue. The relativity of truth-values is focused by this way, thereby leading to an additional way of logical pluralism.
International Nuclear Information System (INIS)
Wall, M.J.W.
1992-01-01
The notion of open-quotes probabilityclose quotes is generalized to that of open-quotes likelihood,close quotes and a natural logical structure is shown to exist for any physical theory which predicts likelihoods. Two physically based axioms are given for this logical structure to form an orthomodular poset, with an order-determining set of states. The results strengthen the basis of the quantum logic approach to axiomatic quantum theory. 25 refs
Logical database design principles
Garmany, John; Clark, Terry
2005-01-01
INTRODUCTION TO LOGICAL DATABASE DESIGNUnderstanding a Database Database Architectures Relational Databases Creating the Database System Development Life Cycle (SDLC)Systems Planning: Assessment and Feasibility System Analysis: RequirementsSystem Analysis: Requirements Checklist Models Tracking and Schedules Design Modeling Functional Decomposition DiagramData Flow Diagrams Data Dictionary Logical Structures and Decision Trees System Design: LogicalSYSTEM DESIGN AND IMPLEMENTATION The ER ApproachEntities and Entity Types Attribute Domains AttributesSet-Valued AttributesWeak Entities Constraint
Czech Academy of Sciences Publication Activity Database
Peliš, Michal
2017-01-01
Roč. 26, č. 3 (2017), s. 357-381 ISSN 1425-3305 R&D Projects: GA ČR(CZ) GC16-07954J Institutional support: RVO:67985955 Keywords : epistemic logic * erotetic implication * erotetic logic * logic of questions Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology http://apcz.umk.pl/czasopisma/index.php/LLP/article/view/LLP.2017.007
Pereyra, Nicolas A.
2018-06-01
This book gives a rigorous yet 'physics-focused' introduction to mathematical logic that is geared towards natural science majors. We present the science major with a robust introduction to logic, focusing on the specific knowledge and skills that will unavoidably be needed in calculus topics and natural science topics in general (rather than taking a philosophical-math-fundamental oriented approach that is commonly found in mathematical logic textbooks).
Crossley, J N; Brickhill, CJ; Stillwell, JC
2010-01-01
Although mathematical logic can be a formidably abstruse topic, even for mathematicians, this concise book presents the subject in a lively and approachable fashion. It deals with the very important ideas in modern mathematical logic without the detailed mathematical work required of those with a professional interest in logic.The book begins with a historical survey of the development of mathematical logic from two parallel streams: formal deduction, which originated with Aristotle, Euclid, and others; and mathematical analysis, which dates back to Archimedes in the same era. The streams beg
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2012-01-01
In this paper we explore the logic of now, yesterday, today and tomorrow by combining the semantic approach to indexicality pioneered by Hans Kamp [9] and refined by David Kaplan [10] with hybrid tense logic. We first introduce a special now nominal (our @now corresponds to Kamp’s original now...... operator N) and prove completeness results for both logical and contextual validity. We then add propositional constants to handle yesterday, today and tomorrow; our system correctly treats sentences like “Niels will die yesterday” as contextually unsatisfiable. Building on our completeness results for now......, we prove completeness for the richer language, again for both logical and contextual validity....
DEFF Research Database (Denmark)
Lopez, Hugo Andres; Carbone, Marco; Hildebrandt, Thomas
2010-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for speciﬁcation and veriﬁcation of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL...... ), a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service speciﬁcations. Finally, we show that, despite GL is undecidable, there is a signiﬁcant decidable fragment which we provide with a sound and complete proof...
International Nuclear Information System (INIS)
Andronov, A.A.; Kurin, V.V.; Levichev, M.Yu.; Ryndyk, D.A.; Vostokov, V.I.
1993-01-01
In recent years there has been much interest in superconductor logical devices. Our paper is devoted to the analysis of some new possibilities in this field. The main problems here are: minimization of time of logical operations and reducing of device scale. Josephson systems are quite appropriate for this purpose because of small size, short characteristic time and also small energy losses. Two different types of Josephson logic have been investigated during last years. The first type is based on hysteretic V-A characteristic of a single Josephson junction. Superconducting and resistive (with nonzero voltage) states are considered as logical zero and logical unit. The second one - rapid single flux quantum logic, has been developed recently and is based on SQUID-like bistability. Different logical states are the states with different number of magnetic flux quanta inside closed superconducting contour. Information is represented by voltage pulses with fixed ''area'' (∫ V(t)/dt). This pulses are generated when logical state of SQUID-like elementary cell changes. The fundamental role of magnetic flux quantization in this type of logic leads to the necessity of large enough self-inductance of superconductor contour and thus to limitations on minimal device dimensions. (orig.)
Directory of Open Access Journals (Sweden)
Marco Carbone
2011-10-01
Full Text Available We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL, a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a significant decidable fragment which we provide with a sound and complete proof system for checking validity of formulae.
Introduction to mathematical logic
Mendelson, Elliott
2015-01-01
The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.The sixth edition incorporates recent work on Gödel's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition. It is offered in th
Questions of Logic, Philosophy, and Linguistics
Directory of Open Access Journals (Sweden)
Marcio Chaves-Tannús
2011-04-01
Full Text Available There were in the past, just as there are in the present, several diverse attempts to establish a unique theory capable of identifying in all natural languages a similar, invariable basic structure of a logical nature. If such a theory exists, then there must be principles that rule the functioning of these languages and they must have a logical origin. Based on a work by the French linguist, Oswald Ducrot, entitled D’un mauvais usage de la logique, this paper aims to present in a concise manner two of the above mentioned attempts. They were elaborated in diverse epochs and different arguments were put forward to support them. The first attempt was in XVII century France and its theoretic basis was the renowned ‘Port-Royal Logic’. The second attempt is recent and its theoretic support comes from Contemporary Logic.
Contribution of Warsaw Logicians to Computational Logic
Directory of Open Access Journals (Sweden)
Damian Niwiński
2016-06-01
Full Text Available The newly emerging branch of research of Computer Science received encouragement from the successors of the Warsaw mathematical school: Kuratowski, Mazur, Mostowski, Grzegorczyk, and Rasiowa. Rasiowa realized very early that the spectrum of computer programs should be incorporated into the realm of mathematical logic in order to make a rigorous treatment of program correctness. This gave rise to the concept of algorithmic logic developed since the 1970s by Rasiowa, Salwicki, Mirkowska, and their followers. Together with Pratt’s dynamic logic, algorithmic logic evolved into a mainstream branch of research: logic of programs. In the late 1980s, Warsaw logicians Tiuryn and Urzyczyn categorized various logics of programs, depending on the class of programs involved. Quite unexpectedly, they discovered that some persistent open questions about the expressive power of logics are equivalent to famous open problems in complexity theory. This, along with parallel discoveries by Harel, Immerman and Vardi, contributed to the creation of an important area of theoretical computer science: descriptive complexity. By that time, the modal μ-calculus was recognized as a sort of a universal logic of programs. The mid 1990s saw a landmark result by Walukiewicz, who showed completeness of a natural axiomatization for the μ-calculus proposed by Kozen. The difficult proof of this result, based on automata theory, opened a path to further investigations. Later, Bojanczyk opened a new chapter by introducing an unboundedness quantifier, which allowed for expressing some quantitative properties of programs. Yet another topic, linking the past with the future, is the subject of automata founded in the Fraenkel-Mostowski set theory. The studies on intuitionism found their continuation in the studies of Curry-Howard isomorphism. ukasiewicz’s landmark idea of many-valued logic found its continuation in various approaches to incompleteness and uncertainty.
Non-Well-Founded Proofs for the Grzegorczyk Modal Logic
Savateev, Yury; Shamkanov, Daniyar
2018-01-01
We present a sequent calculus for the Grzegorczyk modal logic Grz allowing cyclic and other non-well-founded proofs and obtain the cut-elimination theorem for it by constructing a continuous cut-elimination mapping acting on these proofs. As an application, we establish the Lyndon interpolation property for the logic Grz proof-theoretically.
Understanding Social Media Logic
Directory of Open Access Journals (Sweden)
José van Dijck
2013-08-01
Full Text Available Over the past decade, social media platforms have penetrated deeply into the mechanics of everyday life, affecting people's informal interactions, as well as institutional structures and professional routines. Far from being neutral platforms for everyone, social media have changed the conditions and rules of social interaction. In this article, we examine the intricate dynamic between social media platforms, mass media, users, and social institutions by calling attention to social media logic—the norms, strategies, mechanisms, and economies—underpinning its dynamics. This logic will be considered in light of what has been identified as mass media logic, which has helped spread the media's powerful discourse outside its institutional boundaries. Theorizing social media logic, we identify four grounding principles—programmability, popularity, connectivity, and datafication—and argue that these principles become increasingly entangled with mass media logic. The logic of social media, rooted in these grounding principles and strategies, is gradually invading all areas of public life. Besides print news and broadcasting, it also affects law and order, social activism, politics, and so forth. Therefore, its sustaining logic and widespread dissemination deserve to be scrutinized in detail in order to better understand its impact in various domains. Concentrating on the tactics and strategies at work in social media logic, we reassess the constellation of power relationships in which social practices unfold, raising questions such as: How does social media logic modify or enhance existing mass media logic? And how is this new media logic exported beyond the boundaries of (social or mass media proper? The underlying principles, tactics, and strategies may be relatively simple to identify, but it is much harder to map the complex connections between platforms that distribute this logic: users that employ them, technologies that
Modern linear control design a time-domain approach
Caravani, Paolo
2013-01-01
This book offers a compact introduction to modern linear control design. The simplified overview presented of linear time-domain methodology paves the road for the study of more advanced non-linear techniques. Only rudimentary knowledge of linear systems theory is assumed - no use of Laplace transforms or frequency design tools is required. Emphasis is placed on assumptions and logical implications, rather than abstract completeness; on interpretation and physical meaning, rather than theoretical formalism; on results and solutions, rather than derivation or solvability. The topics covered include transient performance and stabilization via state or output feedback; disturbance attenuation and robust control; regional eigenvalue assignment and constraints on input or output variables; asymptotic regulation and disturbance rejection. Lyapunov theory and Linear Matrix Inequalities (LMI) are discussed as key design methods. All methods are demonstrated with MATLAB to promote practical use and comprehension. ...
Weakly Intuitionistic Quantum Logic
Hermens, Ronnie
2013-01-01
In this article von Neumann's proposal that in quantum mechanics projections can be seen as propositions is followed. However, the quantum logic derived by Birkhoff and von Neumann is rejected due to the failure of the law of distributivity. The options for constructing a distributive logic while
Kuusisto, Antti
2013-01-01
In recent years, research into the mathematical foundations of modal logic has become increasingly popular. One of the main reasons for this is the fact that modal logic seems to adapt well to the requirements of a wide range of different fields of application. This paper is a summary of some of the author’s contributions to the understanding of modal definability theory.
Cirstea, C.; Kurz, A.; Pattinson, D.; Schröder, L.; Venema, Y.
2011-01-01
Applications of modal logics are abundant in computer science, and a large number of structurally different modal logics have been successfully employed in a diverse spectrum of application contexts. Coalgebraic semantics, on the other hand, provides a uniform and encompassing view on the large
CSIR Research Space (South Africa)
Klarman, S
2013-05-01
Full Text Available We introduce Description Logics of Context (DLCs) - an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy's tradition of treating contexts as formal objects over which one can quantify...
Criteria for logical formalization
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav; Svoboda, Vladimír
2013-01-01
Roč. 190, č. 14 (2013), s. 2897-2924 ISSN 0039-7857 R&D Projects: GA ČR(CZ) GAP401/10/1279 Institutional support: RVO:67985955 Keywords : logic * logical form * formalization * reflective equilibrium Subject RIV: AA - Philosophy ; Religion Impact factor: 0.637, year: 2013
NEVEN, Frank
2002-01-01
We survey some recent developments in the broad area of automata and logic which are motivated by the advent of XML. In particular, we consider unranked tree automata, tree-walking automata, and automata over infinite alphabets. We focus on their connection with logic and on questions imposed by XML.
Directory of Open Access Journals (Sweden)
Evandro Agazzi
2011-06-01
Full Text Available Humans have used arguments for defending or refuting statements long before the creation of logic as a specialized discipline. This can be interpreted as the fact that an intuitive notion of "logical consequence" or a psychic disposition to articulate reasoning according to this pattern is present in common sense, and logic simply aims at describing and codifying the features of this spontaneous capacity of human reason. It is well known, however, that several arguments easily accepted by common sense are actually "logical fallacies", and this indicates that logic is not just a descriptive, but also a prescriptive or normative enterprise, in which the notion of logical consequence is defined in a precise way and then certain rules are established in order to maintain the discourse in keeping with this notion. Yet in the justification of the correctness and adequacy of these rules commonsense reasoning must necessarily be used, and in such a way its foundational role is recognized. Moreover, it remains also true that several branches and forms of logic have been elaborated precisely in order to reflect the structural features of correct argument used in different fields of human reasoning and yet insufficiently mirrored by the most familiar logical formalisms.
A. Ponse (Alban); M.B. van der Zwaag
2002-01-01
textabstractWe distinguish two interpretations for the truth value `undefined' in Kleene's three-valued logic. Combining these two interpretations leads to a four-valued propositional logic that characterizes two particular ingredients of process algebra: ``choice' and ``inaction'. We study two
Uckelman, S.L.
2009-01-01
The origins of treating agency as a modal concept go back at least to the 11th century when Anselm, Archbishop of Canterbury, provided a modal explication of the Latin facere ‘to do’, which can be formalized within the context of modern modal logic and neighborhood semantics. The agentive logic
Temporalized Epistemic Default Logic
van der Hoek, W.; Meyer, J.J.; Treur, J.; Gabbay, D.
2001-01-01
The nonmonotonic logic Epistemic Default Logic (EDL) [Meyer and van der Hoek, 1993] is based on the metaphore of a meta-level architecture. It has already been established [Meyer and van der Hoek, 1993] how upward reflection can be formalized by a nonmonotonic entailment based on epistemic states,
Lopez, Antonio M., Jr.
1989-01-01
Provides background material on logic programing and presents PROLOG as a high-level artificial intelligence programing language that borrows its basic constructs from logic. Suggests the language is one which will help the educator to achieve various goals, particularly the promotion of problem solving ability. (MVL)
W. van der Hoek (Wiebe); J.O.M. Jaspars; E. Thijsse
1995-01-01
textabstractWe propose an epistemic logic in which knowledge is fully introspective and implies truth, although truth need not imply epistemic possibility. The logic is presented in sequential format and is interpreted in a natural class of partial models, called balloon models. We examine the
Amplifying genetic logic gates.
Bonnet, Jerome; Yin, Peter; Ortiz, Monica E; Subsoontorn, Pakpoom; Endy, Drew
2013-05-03
Organisms must process information encoded via developmental and environmental signals to survive and reproduce. Researchers have also engineered synthetic genetic logic to realize simpler, independent control of biological processes. We developed a three-terminal device architecture, termed the transcriptor, that uses bacteriophage serine integrases to control the flow of RNA polymerase along DNA. Integrase-mediated inversion or deletion of DNA encoding transcription terminators or a promoter modulates transcription rates. We realized permanent amplifying AND, NAND, OR, XOR, NOR, and XNOR gates actuated across common control signal ranges and sequential logic supporting autonomous cell-cell communication of DNA encoding distinct logic-gate states. The single-layer digital logic architecture developed here enables engineering of amplifying logic gates to control transcription rates within and across diverse organisms.
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
of competition are only realized as particular forms of social organization by virtue of interplaying with other kinds of logics, like legal logics. (2) Competition logics enjoy a peculiar status in-between constructedness and givenness; although competition depends on laws and mechanisms of socialization, we...... still experience competition as an expression of spontaneous human activities. On the basis of these perspectives, a study of fundamental rights of EU law, springing from the principle of ‘free movement of people’, is conducted. The first part of the empirical analysis seeks to detect the presence...... of a presumed logic of competition within EU law, whereas the second part focuses on particular legal logics. In this respect, the so-called ‘real link criterion’ (determining the access to transnational social rights for certain groups of unemployed people) is given special attention. What is particularly...
Analogical proportions: another logical view
Prade, Henri; Richard, Gilles
This paper investigates the logical formalization of a restricted form of analogical reasoning based on analogical proportions, i.e. statements of the form a is to b as c is to d. Starting from a naive set theoretic interpretation, we highlight the existence of two noticeable companion proportions: one states that a is to b the converse of what c is to d (reverse analogy), while the other called paralogical proportion expresses that what a and b have in common, c and d have it also. We identify the characteristic postulates of the three types of proportions and examine their consequences from an abstract viewpoint. We further study the properties of the set theoretic interpretation and of the Boolean logic interpretation, and we provide another light on the understanding of the role of permutations in the modeling of the three types of proportions. Finally, we address the use of these proportions as a basis for inference in a propositional setting, and relate it to more general schemes of analogical reasoning. The differences between analogy, reverse-analogy, and paralogy is still emphasized in a three-valued setting, which is also briefly presented.
Decision logics in radiotherapy
International Nuclear Information System (INIS)
Gauwerky, F.
1979-01-01
Decisions in planning procedures can generally, at least for beam therapy to deep seated tumors, be based on a self-consistent system of criteria of optimization, namely: 1. The absorbed dose to the target volume must be applied as uniformly as possible. 2. Absorbed doses to organs (volumes) at risk must be as low as possible, at least below an accepted limit. 3. Radiation effects to outside volumes must be kept as low as possible. Whereas these criteria, as being reduced to the simplest possible requirements, have to be regarded as the stable elements, the radiotherapy parameters, such as geometric arrangements, special techniques, absorbed dose contributions to reference points or systems, have to be taken as the variables within decision processes. The properties of the criteria which have widely proved to be valuable in routine clinical practice, have been investigated in relation to the theoretical system of axioms as it is e.g. offered by Karl Popper's general logics of scientific research. An axiomatic system, as it is demanded (after Popper) must be a) free of discrepancies, i.e. self-consistent (not any sentence can be derived), b) independent, that is, one axiom cannot be derived from another one within the system, c) sufficient for deduction of statements needed, d) necessary, that is complete. All these requirements are fitting also to the offered system of radiotherapy optimization criteria. It has been demonstrated, that Popper's axiomatic system can be regarded as to be the general case for all scientific fields of application, the set of optimization criteria being a special system for radiation therapy, which would have been derivable from Popper's theory. Also practical use could be demonstrated. (orig./ORU) [de
Instantons in Self-Organizing Logic Gates
Bearden, Sean R. B.; Manukian, Haik; Traversa, Fabio L.; Di Ventra, Massimiliano
2018-03-01
Self-organizing logic is a recently suggested framework that allows the solution of Boolean truth tables "in reverse"; i.e., it is able to satisfy the logical proposition of gates regardless to which terminal(s) the truth value is assigned ("terminal-agnostic logic"). It can be realized if time nonlocality (memory) is present. A practical realization of self-organizing logic gates (SOLGs) can be done by combining circuit elements with and without memory. By employing one such realization, we show, numerically, that SOLGs exploit elementary instantons to reach equilibrium points. Instantons are classical trajectories of the nonlinear equations of motion describing SOLGs and connect topologically distinct critical points in the phase space. By linear analysis at those points, we show that these instantons connect the initial critical point of the dynamics, with at least one unstable direction, directly to the final fixed point. We also show that the memory content of these gates affects only the relaxation time to reach the logically consistent solution. Finally, we demonstrate, by solving the corresponding stochastic differential equations, that, since instantons connect critical points, noise and perturbations may change the instanton trajectory in the phase space but not the initial and final critical points. Therefore, even for extremely large noise levels, the gates self-organize to the correct solution. Our work provides a physical understanding of, and can serve as an inspiration for, models of bidirectional logic gates that are emerging as important tools in physics-inspired, unconventional computing.
A sequent calculus for signed interval logic
DEFF Research Database (Denmark)
Rasmussen, Thomas Marthedal
2001-01-01
We propose and discuss a complete sequent calculus formulation for Signed Interval Logic (SIL) with the chief purpose of improving proof support for SIL in practice. The main theoretical result is a simple characterization of the limit between decidability and undecidability of quantifier-free SIL....... We present a mechanization of SIL in the generic proof assistant Isabelle and consider techniques for automated reasoning. Many of the results and ideas of this report are also applicable to traditional (non-signed) interval logic and, hence, to Duration Calculus....
International Nuclear Information System (INIS)
Mittelstaedt, P.
1983-01-01
on the basis of the well-known quantum logic and quantum probability a formal language of relativistic quantum physics is developed. This language incorporates quantum logical as well as relativistic restrictions. It is shown that relativity imposes serious restrictions on the validity regions of propositions in space-time. By an additional postulate this relativistic quantum logic can be made consistent. The results of this paper are derived exclusively within the formal quantum language; they are, however, in accordance with well-known facts of relativistic quantum physics in Hilbert space. (author)
Logical inference and evaluation
International Nuclear Information System (INIS)
Perey, F.G.
1981-01-01
Most methodologies of evaluation currently used are based upon the theory of statistical inference. It is generally perceived that this theory is not capable of dealing satisfactorily with what are called systematic errors. Theories of logical inference should be capable of treating all of the information available, including that not involving frequency data. A theory of logical inference is presented as an extension of deductive logic via the concept of plausibility and the application of group theory. Some conclusions, based upon the application of this theory to evaluation of data, are also given
International Nuclear Information System (INIS)
Thode, L.E.
1978-09-01
A 36-month program to study the linear relativistic electron beam-plasma interaction is proposed. This program is part of a joint proposal between the Physics International Company (PI) and Los Alamos Scientific Laboratory (LASL) that combines the advanced electron beam generator technology at PI with the highly developed computer simulation technology at LASL. The proposed LASL program includes direct support for 1- and 3-m beam-plasma interaction experiments planned at PI and development of theory relevant for design of a 10-m proof-of-principle electron beam-driven linear solenoidal reactor
Linear contextual modal type theory
DEFF Research Database (Denmark)
Schack-Nielsen, Anders; Schürmann, Carsten
Abstract. When one implements a logical framework based on linear type theory, for example the Celf system [?], one is immediately con- fronted with questions about their equational theory and how to deal with logic variables. In this paper, we propose linear contextual modal type theory that gives...... a mathematical account of the nature of logic variables. Our type theory is conservative over intuitionistic contextual modal type theory proposed by Nanevski, Pfenning, and Pientka. Our main contributions include a mechanically checked proof of soundness and a working implementation....
Lindström theorems for fragments of first-order logic
van Benthem, J.; ten Cate, B.; Väänänen, J.
2009-01-01
Lindström theorems characterize logics in terms of model-theoretic conditions such as Compactness and the Löwenheim-Skolem property. Most existing characterizations of this kind concern extensions of first-order logic. But on the other hand, many logics relevant to computer science are fragments or
The Quantum Logical Challenge: Peter Mittelstaedt's Contributions to Logic and Philosophy of Science
Beltrametti, E.; Dalla Chiara, M. L.; Giuntini, R.
2017-12-01
Peter Mittelstaedt's contributions to quantum logic and to the foundational problems of quantum theory have significantly realized the most authentic spirit of the International Quantum Structures Association: an original research about hard technical problems, which are often "entangled" with the emergence of important changes in our general world-conceptions. During a time where both the logical and the physical community often showed a skeptical attitude towards Birkhoff and von Neumann's quantum logic, Mittelstaedt brought into light the deeply innovating features of a quantum logical thinking that allows us to overcome some strong and unrealistic assumptions of classical logical arguments. Later on his intense research on the unsharp approach to quantum theory and to the measurement problem stimulated the increasing interest for unsharp forms of quantum logic, creating a fruitful interaction between the work of quantum logicians and of many-valued logicians. Mittelstaedt's general views about quantum logic and quantum theory seem to be inspired by a conjecture that is today more and more confirmed: there is something universal in the quantum theoretic formalism that goes beyond the limits of microphysics, giving rise to interesting applications to a number of different fields.
Linearly Refined Session Types
Directory of Open Access Journals (Sweden)
Pedro Baltazar
2012-11-01
Full Text Available Session types capture precise protocol structure in concurrent programming, but do not specify properties of the exchanged values beyond their basic type. Refinement types are a form of dependent types that can address this limitation, combining types with logical formulae that may refer to program values and can constrain types using arbitrary predicates. We present a pi calculus with assume and assert operations, typed using a session discipline that incorporates refinement formulae written in a fragment of Multiplicative Linear Logic. Our original combination of session and refinement types, together with the well established benefits of linearity, allows very fine-grained specifications of communication protocols in which refinement formulae are treated as logical resources rather than persistent truths.
Fisher, Michael; Gabbay, Dov; Gough, Graham
2000-01-01
Time is a fascinating subject that has captured mankind's imagination from ancient times to the present. It has been, and continues to be studied across a wide range of disciplines, from the natural sciences to philosophy and logic. More than two decades ago, Pnueli in a seminal work showed the value of temporal logic in the specification and verification of computer programs. Today, a strong, vibrant international research community exists in the broad community of computer science and AI. This volume presents a number of articles from leading researchers containing state-of-the-art results in such areas as pure temporal/modal logic, specification and verification, temporal databases, temporal aspects in AI, tense and aspect in natural language, and temporal theorem proving. Earlier versions of some of the articles were given at the most recent International Conference on Temporal Logic, University of Manchester, UK. Readership: Any student of the area - postgraduate, postdoctoral or even research professor ...
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study of inform......Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...... of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method....
International Nuclear Information System (INIS)
Khitun, Alexander; Bao Mingqiang; Wang, Kang L
2010-01-01
We describe and analyse possible approaches to magnonic logic circuits and basic elements required for circuit construction. A distinctive feature of the magnonic circuitry is that information is transmitted by spin waves propagating in the magnetic waveguides without the use of electric current. The latter makes it possible to exploit spin wave phenomena for more efficient data transfer and enhanced logic functionality. We describe possible schemes for general computing and special task data processing. The functional throughput of the magnonic logic gates is estimated and compared with the conventional transistor-based approach. Magnonic logic circuits allow scaling down to the deep submicrometre range and THz frequency operation. The scaling is in favour of the magnonic circuits offering a significant functional advantage over the traditional approach. The disadvantages and problems of the spin wave devices are also discussed.
Characterization of quantum logics
International Nuclear Information System (INIS)
Lahti, P.J.
1980-01-01
The quantum logic approach to axiomatic quantum mechanics is used to analyze the conceptual foundations of the traditional quantum theory. The universal quantum of action h>0 is incorporated into the theory by introducing the uncertainty principle, the complementarity principle, and the superposition principle into the framework. A characterization of those quantum logics (L,S) which may provide quantum descriptions is then given. (author)
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
1999-01-01
Conceptual spaces have been proposed as topological or geometric means for establishing conceptual structures and models. This paper, after briey reviewing conceptual spaces, focusses on the relationship between conceptual spaces and logical concept languages with operations for combining concepts...... to form concepts. Speci cally is introduced an algebraic concept logic, for which conceptual spaces are installed as semantic domain as replacement for, or enrichment of, the traditional....
Characteristics of a Circular Logic and Its Treatment
International Nuclear Information System (INIS)
Lim, Ho-Gon; Han, Sang-Hoon; Yang, Joon Eon
2007-01-01
A circular logic or a logical loop is defined as the infinite circulation of supporting relations due to their mutual dependencies among the systems in the Fault Tree Analysis (FTA). While many methods to break the circular logic have been developed and used in the fault tree quantification codes, the general solution for a circular logic and its breaking methods are not generally known as yet. This paper presents an analytic solution for circular logics in which the systems are linearly interrelated with each other. Then, a general treatment of circular logics is discussed. To formulate the analytic solution, the relations among systems in the fault tree structure are described by the Boolean equations. The solution is, then, obtained from the successive substitutions of the Boolean equations, which is equivalent to the attaching processes of interrelated system's fault tree to a given fault tree. The solution for three interrelated systems and their independent fault tree structures are given as an example
Extending Value Logic Thinking to Value Logic Portfolios
DEFF Research Database (Denmark)
Andersen, Poul Houman; Ritter, Thomas
2014-01-01
Based on value creation logic theory (Stabell & Fjeldstad, 1998), this paper suggests an extension of the original Stabell & Fjeldstad model by an additional fourth value logic, the value system logic. Furthermore, instead of only allowing one dominant value creation logic for a given firm...... or transaction, an understanding of firms and transactions as a portfolio of value logics (i.e. an interconnected coexistence of different value creation logics) is proposed. These additions to the original value creation logic theory imply interesting avenues for both, strategic decision making in firms...
Towards a Formal Occurrence Logic based on Predicate Logic
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
2015-01-01
In this discussion we will concentrate on the main characteristics of an alternative kind of logic invented by Hans Götzsche: Occurrence Logic, which is not based on truth functionality. Our approach is based on temporal logic developed and elaborated by A. N. Prior. We will focus on characterising...... argumentation based on formal Occurrence Logic concerning events and occurrences, and illustrate the relations between Predicate Logic and Occurrence Logic. The relationships (and dependencies) is conducive to an approach that can analyse the occurrences of ”logical statements based on different logical...... principles” in different moments. We will also conclude that the elaborated Götzsche’s Occurrence Logic could be able to direct us to a truth-functional independent computer-based logic for analysing argumentation based on events and occurrences....
On the Predictability of Classical Propositional Logic
Directory of Open Access Journals (Sweden)
Poliana M. Reis
2013-01-01
Full Text Available In this work we provide a statistical form of empirical analysis of classical propositional logic decision methods called SAT solvers. This work is perceived as an empirical counterpart of a theoretical movement, called the enduring scandal of deduction, that opposes considering Boolean Logic as trivial in any sense. For that, we study the predictability of classical logic, which we take to be the distribution of the runtime of its decision process. We present a series of experiments that determines the run distribution of SAT solvers and discover a varying landscape of distributions, following the known existence of a transition of easy-hard-easy cases of propositional formulas. We find clear distributions for the easy areas and the transitions easy-hard and hard-easy. The hard cases are shown to be hard also for the detection of statistical distributions, indicating that several independent processes may be at play in those cases.
Modern logic and quantum mechanics
International Nuclear Information System (INIS)
Garden, R.W.
1984-01-01
The book applies the methods of modern logic and probabilities to ''interpreting'' quantum mechanics. The subject is described and discussed under the chapter headings: classical and quantum mechanics, modern logic, the propositional logic of mechanics, states and measurement in mechanics, the traditional analysis of probabilities, the probabilities of mechanics and the model logic of predictions. (U.K.)
Relational Parametricity and Separation Logic
DEFF Research Database (Denmark)
Birkedal, Lars; Yang, Hongseok
2008-01-01
Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new interpretation of the logic for a programming language with higher types. Our interpretation is based on Reynolds's relational...... parametricity, and it provides a formal connection between separation logic and data abstraction. Udgivelsesdato: 2008...
Non-logic devices in logic processes
Ma, Yanjun
2017-01-01
This book shows readers how to design semiconductor devices using the most common and lowest cost logic CMOS processes. Readers will benefit from the author’s extensive, industrial experience and the practical approach he describes for designing efficiently semiconductor devices that typically have to be implemented using specialized processes that are expensive, time-consuming, and low-yield. The author presents an integrated picture of semiconductor device physics and manufacturing techniques, as well as numerous practical examples of device designs that are tried and true.
The dark side of Interval Temporal Logic: sharpening the undecidability border
DEFF Research Database (Denmark)
Bresolin, Davide; Monica, Dario Della; Goranko, Valentin
2011-01-01
on the class of models (in our case, the class of interval structures)in which it is interpreted. In this paper, we have identified several new minimal undecidable logics amongst the fragments of Halpern-Shoham logic HS, including the logic of the overlaps relation, over the classes of all and finite linear...... orders, as well as the logic of the meet and subinterval relations, over the class of dense linear orders. Together with previous undecid ability results, this work contributes to delineate the border of the dark side of interval temporal logics quite sharply....
Energy Technology Data Exchange (ETDEWEB)
Shigemitsu, Yasuhiro. [Nagasaki Industrial Technology Center, Nagasaki (Japan)
1999-07-01
heoretical researches relating to excitation spectrum of furan have been carried out for many years, and they reveal the problems that should be solved in order to predict highly reliable excitation energy. In general, it is difficult to uniformly obtain highly reliable calculation results for all excitation states since different excitation states show different electronic correlative effects. Means for obtaining the electron states in ground state and excited state and calculating the energy difference thereof is the mainstream of the theoretical calculation of the excitation energy. CASSCF/CASPT 2 developed by Roos et al. is a typical method excellent in quantitative description. Recently, the comparison between direct CCLR and CASSCF/CASPT 2 as examples for calculating the excitation spectrum of furan was carried out by using the same ground function. For Rydberg excitation, CC3, CAS, CASPT 2 show good agreement with each other. (NEDO)
Directory of Open Access Journals (Sweden)
Antônio M. Da Silva Jr.
2009-01-01
Full Text Available Structure and first hyperpolarizability for a series of armchair a(5,5 chemically modified carbon nanotubes (CNT were calculated at semiempirical and density functional levels of theory. The 4,4´-substituted stilbenes were selected as chromophore with substituents at position 4´ set to X=NO2, H, Cl, OH and NH2. The calculated values for static first hyperpolarizability (β were almost linearly dependent on the electronic effect of the group X, increasing from NO2 to NH2. At DFT level the effect of inserting the chromophore in the CNT surface was to enhance the β value up to 70% relative to the free 4,4´-substituted stilbene.
A logical approach to security in the context of Ambient Calculus
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Priami, Corrado
2004-01-01
A logical approach to security in the context of Ambient Calculus. Electronic Notes in Theoretical Computer Science, N 99:3-29, 2004......A logical approach to security in the context of Ambient Calculus. Electronic Notes in Theoretical Computer Science, N 99:3-29, 2004...
The Logic of Public-Private Partnerships
DEFF Research Database (Denmark)
Greve, Carsten; Hodge, Graeme
This paper is situated at the nexus of two literatures: theoretical ideas from political science on the relationship between politics and markets, and the more recent public policy phenomenon of public-private partnerships (PPPs). It aims firstly to map some of the primary theoretical underpinnings...... describing the enduring relationship between governments and businesses. It then focuses on the adoption of PPPs as a popular infrastructure policy, and asks to what extent a particular political-market logic for the adoption of PPP policies appears to exist in leading jurisdictions such as the UK, Australia...... and Canada. It suggests that the empirical evidence on the undue influence of business over political decision making is not one sided and that the arena is still hotly contested. It also suggests that the policy logic of PPPs may be dependent on the relative maturity of governance systems, the relative...
Areces, Carlos; Hoffmann, Guillaume; Denis, Alexandre
We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how this logic has been previously investigated under different guises. We show that the language is related to graded modalities and to hybrid logics. We illustrate a possible application of the language to the treatment of plural objects and queries in natural language. We investigate the expressive power of this logic via bisimulations, discuss the complexity of its satisfiability problem, define a new reasoning task that retrieves the cardinality bound of the extension of a given input formula, and provide an algorithm to solve it.
Diagnosable structured logic array
Whitaker, Sterling (Inventor); Miles, Lowell (Inventor); Gambles, Jody (Inventor); Maki, Gary K. (Inventor)
2009-01-01
A diagnosable structured logic array and associated process is provided. A base cell structure is provided comprising a logic unit comprising a plurality of input nodes, a plurality of selection nodes, and an output node, a plurality of switches coupled to the selection nodes, where the switches comprises a plurality of input lines, a selection line and an output line, a memory cell coupled to the output node, and a test address bus and a program control bus coupled to the plurality of input lines and the selection line of the plurality of switches. A state on each of the plurality of input nodes is verifiably loaded and read from the memory cell. A trusted memory block is provided. The associated process is provided for testing and verifying a plurality of truth table inputs of the logic unit.
Rushton, Andrew
2011-01-01
Many engineers encountering VHDL (very high speed integrated circuits hardware description language) for the first time can feel overwhelmed by it. This book bridges the gap between the VHDL language and the hardware that results from logic synthesis with clear organisation, progressing from the basics of combinational logic, types, and operators; through special structures such as tristate buses, register banks and memories, to advanced themes such as developing your own packages, writing test benches and using the full range of synthesis types. This third edition has been substantially rewritten to include the new VHDL-2008 features that enable synthesis of fixed-point and floating-point hardware. Extensively updated throughout to reflect modern logic synthesis usage, it also contains a complete case study to demonstrate the updated features. Features to this edition include: * a common VHDL subset which will work across a range of different synthesis systems, targeting a very wide range of technologies...
Carlsson, Christer; Fullér, Robert
2004-01-01
Fuzzy Logic in Management demonstrates that difficult problems and changes in the management environment can be more easily handled by bringing fuzzy logic into the practice of management. This explicit theme is developed through the book as follows: Chapter 1, "Management and Intelligent Support Technologies", is a short survey of management leadership and what can be gained from support technologies. Chapter 2, "Fuzzy Sets and Fuzzy Logic", provides a short introduction to fuzzy sets, fuzzy relations, the extension principle, fuzzy implications and linguistic variables. Chapter 3, "Group Decision Support Systems", deals with group decision making, and discusses methods for supporting the consensus reaching processes. Chapter 4, "Fuzzy Real Options for Strategic Planning", summarizes research where the fuzzy real options theory was implemented as a series of models. These models were thoroughly tested on a number of real life investments, and validated in 2001. Chapter 5, "Soft Computing Methods for Reducing...
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates...... of the exponentially distributed random variables that characterize the duration of the labeled transitions of a CMP. In this paper we present weak and strong complete axiomatizations for CML and prove a series of metaproperties, including the finite model property and the construction of canonical models. CML...... characterizes stochastic bisimilarity and it supports the definition of a quantified extension of the satisfiability relation that measures the "compatibility" between a model and a property. In this context, the metaproperties allows us to prove two robustness theorems for the logic stating that one can...
Mixing Categories and Modal Logics in the Quantum Setting
Cinà, G.; Aerts, D.; de Ronde, C.; Freytes, H.; Giuntini, R.
2016-01-01
The study of the foundations of Quantum Mechanics, especially after the advent of Quantum Computation and Information, has benefited from the application of category-theoretic tools and modal logics to the analysis of Quantum processes: we witness a wealth of theoretical frameworks casted in either
Energy Technology Data Exchange (ETDEWEB)
Gonzalez M, V. [Comision Nacional de Seguridad Nuclear y Salvaguardias, 03000 Mexico D.F. (Mexico); Salinas H, J.G.; Espinosa P, G. [Universidad Autonoma Metropolitana-Iztapalapa, 09000 Mexico D.F. (Mexico)
2000-07-01
The Technology, Regulation and Services Management of the National Commission of Nuclear Safety and Safeguards in coordinated form with the IPH Department of the Metropolitan Autonomous-Iztapalapa University, developed the present project to study the linear stability in a fuel channel uniformly heated with effects of retrofeeding by vacuums. In this study the methodology used in the analysis of linear stability of the nuclear reactor unit 1 at Laguna Verde power plant is described which represented by an average channel uniformly heated. The conceptual model consists of two cells which represent the two regions in which is divided the channel according to the cooling is in one and two phases, considering the boiling length dependent in the time. It is used the homogeneous flux models for describing the thermohydraulic behavior of the cooling in the two phases region. The neutron processes with the punctual model of the neutron kinetics with a group of retarded neutrons precursors are described. It is studied the behavior of the system in the frequency domain with the transfer functions obtained and it is characterized in four operation states corresponding to the four corners of the low stability zone in the map power-flow Laguna Verde power plant. For these operation states the characteristic frequency is determined and the corresponding Nyquist diagrams are obtained. The results show that the system stability depends on the power-flow relation and that the operations which implicate a reduction of this relation improve the stability of the system (reducing the power introducing control bars with constant cooling flow or increase cooling flow with bars pattern established). The obtained results with effects of retrofeeding by vacuums show that the value of the characteristic frequency is modified very little with respect to the model without retrofeeding, therefore the thermohydraulic processes seem to determine the response of the stability of the system
Claude Ziad Bayeh
2015-01-01
The “Manual Logic Controller” also called MLC, is an electronic circuit invented and designed by the author in 2008, in order to replace the well known PLC (Programmable Logic Controller) in many applications for its advantages and its low cost of fabrication. The function of the MLC is somewhat similar to the well known PLC, but instead of doing it by inserting a written program into the PLC using a computer or specific software inside the PLC, it will be manually programmed in a manner to h...
Stoll, Robert R
1979-01-01
Set Theory and Logic is the result of a course of lectures for advanced undergraduates, developed at Oberlin College for the purpose of introducing students to the conceptual foundations of mathematics. Mathematics, specifically the real number system, is approached as a unity whose operations can be logically ordered through axioms. One of the most complex and essential of modern mathematical innovations, the theory of sets (crucial to quantum mechanics and other sciences), is introduced in a most careful concept manner, aiming for the maximum in clarity and stimulation for further study in
Introduction to mathematical logic
Mendelson, Elliott
2009-01-01
The Propositional CalculusPropositional Connectives. Truth TablesTautologies Adequate Sets of Connectives An Axiom System for the Propositional Calculus Independence. Many-Valued LogicsOther AxiomatizationsFirst-Order Logic and Model TheoryQuantifiersFirst-Order Languages and Their Interpretations. Satisfiability and Truth. ModelsFirst-Order TheoriesProperties of First-Order Theories Additional Metatheorems and Derived Rules Rule C Completeness Theorems First-Order Theories with EqualityDefinitions of New Function Letters and Individual Constants Prenex Normal Forms Isomorphism of Interpretati
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artefacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D -algebra....
Energy Technology Data Exchange (ETDEWEB)
Yun, Gil Jung; Yang, Hong Young
2011-03-15
This book is about digital logic circuit test, which lists the digital basic theory, basic gate like and, or And Not gate, NAND/NOR gate such as NAND gate, NOR gate, AND and OR, logic function, EX-OR gate, adder and subtractor, decoder and encoder, multiplexer, demultiplexer, flip-flop, counter such as up/down counter modulus N counter and Reset type counter, shift register, D/A and A/D converter and two supplements list of using components and TTL manual and CMOS manual.
Gibson, J
2013-01-01
Most branches of organizing utilize digital electronic systems. This book introduces the design of such systems using basic logic elements as the components. The material is presented in a straightforward manner suitable for students of electronic engineering and computer science. The book is also of use to engineers in related disciplines who require a clear introduction to logic circuits. This third edition has been revised to encompass the most recent advances in technology as well as the latest trends in components and notation. It includes a wide coverage of application specific integrate
Evens, Aden
2015-01-01
Building a foundational understanding of the digital, Logic of the Digital reveals a unique digital ontology. Beginning from formal and technical characteristics, especially the binary code at the core of all digital technologies, Aden Evens traces the pathways along which the digital domain of abstract logic encounters the material, human world. How does a code using only 0s and 1s give rise to the vast range of applications and information that constitutes a great and growing portion of our world? Evens' analysis shows how any encounter between the actual and the digital must cross an ontolo
Programmable Array Logic Design
International Nuclear Information System (INIS)
Demon Handoyo; Djen Djen Djainal
2007-01-01
Good digital circuit design that part of a complex system, often becoming a separate problem. To produce finishing design according to wanted performance is often given on to considerations which each other confuse, hence thereby analyse optimization become important in this case. To realization is made design logic program, the first are determined global diagram block, then are decided contents of these block diagram, and then determined its interconnection in the form of logic expression, continued with election of component. These steps are done to be obtained the design with low price, easy in its interconnection, minimal volume, low power and certainty god work. (author)
DEFF Research Database (Denmark)
2002-01-01
The proceedings contains 8 papers from the Conference on Theoretical Computer Science. Topics discussed include: query by committee, linear separation and random walks; hardness results for neural network approximation problems; a geometric approach to leveraging weak learners; mind change...
Silicon photonic crystal all-optical logic gates
Energy Technology Data Exchange (ETDEWEB)
Fu, Yulan [State Key Laboratory for Mesoscopic Physics and Department of Physics, Peking University, Beijing 100871 (China); Hu, Xiaoyong, E-mail: xiaoyonghu@pku.edu.cn [State Key Laboratory for Mesoscopic Physics and Department of Physics, Peking University, Beijing 100871 (China); Gong, Qihuang, E-mail: qhgong@pku.edu.cn [State Key Laboratory for Mesoscopic Physics and Department of Physics, Peking University, Beijing 100871 (China)
2013-01-03
All-optical logic gates, including OR, XOR, NOT, XNOR, and NAND gates, are realized theoretically in a two-dimensional silicon photonic crystal using the light beam interference effect. The ingenious photonic crystal waveguide component design, the precisely controlled optical path difference, and the elaborate device configuration ensure the simultaneous realization of five types of logic gate with low-power and a contrast ratio between the logic states of “1” and “0” as high as 20 dB. High power is not necessary for operation of these logic gate devices. This offers a simple and effective approach for the realization of integrated all-optical logic devices.
Quantum logics with existence property
International Nuclear Information System (INIS)
Schindler, C.
1991-01-01
A quantum logic (σ-orthocomplete orthomodular poset L with a convex, unital, and separating set Δ of states) is said to have the existence property if the expectation functionals on lin(Δ) associated with the bounded observables of L form a vector space. Classical quantum logics as well as the Hilbert space logics of traditional quantum mechanics have this property. The author shows that, if a quantum logic satisfies certain conditions in addition to having property E, then the number of its blocks (maximal classical subsystems) must either be one (classical logics) or uncountable (as in Hilbert space logics)
GOAL Agents Instantiate Intention Logic
Hindriks, Koen; van der Hoek, Wiebe
2008-01-01
It is commonly believed there is a big gap between agent logics and computational agent frameworks. In this paper, we show that this gap is not as big as believed by showing that GOAL agents instantiate Intention Logic of Cohen and Levesque. That is, we show that GOAL agent programs can be formally related to Intention Logic.We do so by proving that the GOAL Verification Logic can be embedded into Intention Logic. It follows that (a fragment of) Intention Logic can be used t...
Querying Natural Logic Knowledge Bases
DEFF Research Database (Denmark)
Andreasen, Troels; Bulskov, Henrik; Jensen, Per Anker
2017-01-01
This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes...... in ontologies and class-relationships such as are common in life-science descriptions. The paper adopts a version of natural logic with recursive restrictive clauses such as relative clauses and adnominal prepositional phrases. It includes passive as well as active voice sentences. We outline a prototype...... for partial translation of natural language into natural logic, featuring further querying and conceptual path finding in natural logic knowledge bases....
Linearity in Process Languages
DEFF Research Database (Denmark)
Nygaard, Mikkel; Winskel, Glynn
2002-01-01
The meaning and mathematical consequences of linearity (managing without a presumed ability to copy) are studied for a path-based model of processes which is also a model of affine-linear logic. This connection yields an affine-linear language for processes, automatically respecting open......-map bisimulation, in which a range of process operations can be expressed. An operational semantics is provided for the tensor fragment of the language. Different ways to make assemblies of processes lead to different choices of exponential, some of which respect bisimulation....
International Nuclear Information System (INIS)
Wilkins, T.A.; Chadney, D.C.; Bryant, J.; Palmstroem, S.H.; Winder, R.L.
1977-01-01
Using the simple univalent antigen univalent-antibody equilibrium model the dose-response curve of a radioimmunoassay (RIA) may be expressed as a function of Y, X and the four physical parameters of the idealised system. A compact but powerful mini-computer program has been written in BASIC for rapid iterative non-linear least squares curve fitting and dose interpolation with this function. In its simplest form the program can be operated in an 8K byte mini-computer. The program has been extensively tested with data from 10 different assay systems (RIA and CPBA) for measurement of drugs and hormones ranging in molecular size from thyroxine to insulin. For each assay system the results have been analysed in terms of (a) curve fitting biases and (b) direct comparison with manual fitting. In all cases the quality of fitting was remarkably good in spite of the fact that the chemistry of each system departed significantly from one or more of the assumptions implicit in the model used. A mathematical analysis of departures from the model's principal assumption has provided an explanation for this somewhat unexpected observation. The essential features of this analysis are presented in this paper together with the statistical analyses of the performance of the program. From these and the results obtained to date in the routine quality control of these 10 assays, it is concluded that the method of curve fitting and dose interpolation presented in this paper is likely to be of general applicability. (orig.) [de
Some relationships between logic programming and multiple-valued logic
International Nuclear Information System (INIS)
Rine, D.C.
1986-01-01
There have been suggestions in the artificial intelligence literature that investigations into relationships between logic programming and multiple-valued logic may be helpful. This paper presents some of these relationships through equivalent algebraic evaluations
Value Creation Logics and Internationalization of Service Firms
DEFF Research Database (Denmark)
Ørberg Jensen, Peter D.; Petersen, Bent
2014-01-01
be based on a thorough understanding of the fundamental nature of these firms. Design/methodology/approach - Theoretical study. Findings - We put forward propositions concerning the pace of internationalization and the default foreign operation modes in service firms. Research limitations...... implications - We suggest that managers in service firms should consider primarily the nature of the value creation logic(s) in their firms when deciding and designing an internationalization strategy. Originality/value - The study presents a novel theoretical approach and a set of propositions on service firm....../implications - The use of value creation logics can be a useful complement to the conventional approaches to the study of service firms’ internationalization. However, the fact that most firms encompass more than one value creation logic complicates the use of firm databases and industry statistics. Practical...
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2014-01-01
We study the international standard XACML 3.0 for describing security access control policies in a compositional way. Our main contributions are (i) to derive a logic that precisely captures the intentions of the standard, (ii) to formally define a semantics for the XACML 3.0 component evaluation...
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML...
Klev, Ansten Morch
2014-01-01
The notions of category and type are here studied through the lens of logical syntax: Aristotle's as well as Kant's categories through the traditional form of proposition `S is P', and modern doctrines of type through the Fregean form of proposition `F(a)', function applied to argument. Topics
Structures for Epistemic Logic
Bezhanishvili, N.; Hoek, W. van der
2013-01-01
Epistemic modal logic in a narrow sense studies and formalises reasoning about knowledge. In a wider sense, it gives a formal account of the informational attitude that agents may have, and covers notions like knowledge, belief, uncertainty, and hence incomplete or partial information. As is so
DEFF Research Database (Denmark)
Øhrstrøm, Peter
2009-01-01
's notion of branching time is analysed. It is argued that Prior can be criticized for identifying 'plain future'. Finally, Prior's four grades of tense-logical involvement are introduced and discussed. It is argued that the third grade is the most attractive form a philosophical point of view....
Expressivist Perspective on Logicality
Czech Academy of Sciences Publication Activity Database
Arazim, Pavel
2017-01-01
Roč. 11, č. 4 (2017), s. 409-419 ISSN 1661-8297 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : logical constant * expressivism * topic-neutrality * proof- theory * conservativity Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology
DEFF Research Database (Denmark)
Jensen, Jonas Buhrkal; Birkedal, Lars
2012-01-01
, separation means physical separation. In this paper, we introduce \\emph{fictional separation logic}, which includes more general forms of fictional separating conjunctions P * Q, where "*" does not require physical separation, but may also be used in situations where the memory resources described by P and Q...
Czech Academy of Sciences Publication Activity Database
Klev, Ansten
2017-01-01
Roč. 25, č. 3 (2017), s. 341-368 ISSN 0031-8019 Institutional support: RVO:67985955 Keywords : Philosophy of mathematics * logicism * Richard Dedekind Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology Impact factor: 0.419, year: 2016
DEFF Research Database (Denmark)
Klose, Karl; Ostermann, Klaus
2010-01-01
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze the probl...
LOGICAL SEMANTICS OF MODULARIZATION
DELAVALETTE, GRR
1992-01-01
An algebra of theories, signatures, renamings and the operations import and export is investigated. A normal form theorem for terms of this algebra is proved. Another algebraic approach and the relation with a fragment of second order logic are also considered.
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Foundations of mathematical logic
Curry, Haskell B
2010-01-01
Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods, including algorithms and epitheory, and offers a brief treatment of Markov's approach to algorithms, explains elementary facts about lattices and similar algebraic systems, and more. 1963 edition.
Czech Academy of Sciences Publication Activity Database
Svoboda, Vladimír; Peregrin, Jaroslav
2016-01-01
Roč. 30, č. 3 (2016), s. 263-287 ISSN 0920-427X R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : argumentation * logical form * incorrect argument * correct arguments Subject RIV: AA - Philosophy ; Religion Impact factor: 0.689, year: 2016
Bergstra, J.A.; Ponse, A.
2010-01-01
Short-circuit evaluation denotes the semantics of propositional connectives in which the second argument is only evaluated if the first argument does not suffice to determine the value of the expression. In programming, short-circuit evaluation is widely used. A short-circuit logic is a variant of
Temporal logic motion planning
CSIR Research Space (South Africa)
Seotsanyana, M
2010-01-01
Full Text Available In this paper, a critical review on temporal logic motion planning is presented. The review paper aims to address the following problems: (a) In a realistic situation, the motion planning problem is carried out in real-time, in a dynamic, uncertain...
Logic Programming for Linguistics
DEFF Research Database (Denmark)
Christiansen, Henning
2010-01-01
This article gives a short introduction on how to get started with logic pro- gramming in Prolog that does not require any previous programming expe- rience. The presentation is aimed at students of linguistics, but it does not go deeper into linguistics than any student who has some ideas of what...
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav
2010-01-01
Roč. 4, č. 2 (2010), s. 207-223 ISSN 1661-8297 R&D Projects: GA ČR(CZ) GAP401/10/1279 Institutional research plan: CEZ:AV0Z9009908 Keywords : logic * natural selection * modus potens * inferentialism Subject RIV: AA - Philosophy ; Religion
Quantum probabilistic logic programming
Balu, Radhakrishnan
2015-05-01
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
Temporalizing Epistemic Default Logic
van der Hoek, Wiebe; Meyer, John Jules; Treur, Jan
1998-01-01
We present an epistemic default logic, based on the metaphore of a meta-level architecture. Upward reflection is formalized by a nonmonotonic entailment relation, based on the objective facts that are either known or unknown at the object level. Then, the meta (monotonic) reasoning process generates
Logic Programming with Requests
De Schreye, Danny; Etalle, Sandro; van Raamsdonk, Femke
1999-01-01
We propose an extension of logic programming where the user can specify, together with the initial query, the information he is interested in by means of a request. This allows one to extract a result from an incomplete computation, such as the prefix of an infinite derivation. The classical
Logical Characterisation of Ontology Construction using Fuzzy Description Logics
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
had the extension of ontologies with Fuzzy Logic capabilities which plan to make proper backgrounds for ontology driven reasoning and argumentation on vague and imprecise domains. This presentation conceptualises learning from fuzzy classes using the Inductive Logic Programming framework. Then......, employs Description Logics in characterising and analysing fuzzy statements. And finally, provides a conceptual framework describing fuzzy concept learning in ontologies using the Inductive Logic Programming....
Greek, Indian and Arabic logic
Gabbay, Dov M
2004-01-01
Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and Renaissance Logic and Logic: A History of its Central. In designing the Handbook of the History of Logic, the Editors have taken the view that the history of logic holds more than an antiquarian interest, and that a knowledge of logic's rich and sophisticated development is, in various respects, relevant to the research programmes of the present day. Ancient logic is no exception. The present volume attests to the distant origins of some of modern logic's most important features, such as can be found in the claim by the authors of t...
Radiation tolerant combinational logic cell
Maki, Gary R. (Inventor); Gambles, Jody W. (Inventor); Whitaker, Sterling (Inventor)
2009-01-01
A system has a reduced sensitivity to Single Event Upset and/or Single Event Transient(s) compared to traditional logic devices. In a particular embodiment, the system includes an input, a logic block, a bias stage, a state machine, and an output. The logic block is coupled to the input. The logic block is for implementing a logic function, receiving a data set via the input, and generating a result f by applying the data set to the logic function. The bias stage is coupled to the logic block. The bias stage is for receiving the result from the logic block and presenting it to the state machine. The state machine is coupled to the bias stage. The state machine is for receiving, via the bias stage, the result generated by the logic block. The state machine is configured to retain a state value for the system. The state value is typically based on the result generated by the logic block. The output is coupled to the state machine. The output is for providing the value stored by the state machine. Some embodiments of the invention produce dual rail outputs Q and Q'. The logic block typically contains combinational logic and is similar, in size and transistor configuration, to a conventional CMOS combinational logic design. However, only a very small portion of the circuits of these embodiments, is sensitive to Single Event Upset and/or Single Event Transients.
A Single MEMS Resonator for Reconfigurable Multifunctional Logic Gates
Tella, Sherif Adekunle
2018-04-30
Despite recent efforts toward true electromechanical resonator-based computing, achieving complex logics functions through cascading micro resonators has been deterred by challenges involved in their interconnections and the large required array of resonators. In this work we present a single micro electromechanical resonator with two outputs that enables the realization of multifunctional logic gates as well as other complex logic operations. As examples, we demonstrate the realization of the fundamental 2-bit logic gates of OR, XOR, AND, NOR, and a half adder. The device is based on a compound resonator consisting of a clamped-guided electrostatically actuated arch beam that is attached to another resonant beam from the side, which serves as an additional actuation electrode for the arch. The structure is also provided with an additional electrothermal tuning capability. The logic operations are based on the linear frequency modulations of the arch resonator and side microbeam. The device is compatible with CMOS fabrication process and works at room temperature
A Single MEMS Resonator for Reconfigurable Multifunctional Logic Gates
Tella, Sherif Adekunle; Alcheikh, Nouha; Younis, Mohammad I.
2018-01-01
Despite recent efforts toward true electromechanical resonator-based computing, achieving complex logics functions through cascading micro resonators has been deterred by challenges involved in their interconnections and the large required array of resonators. In this work we present a single micro electromechanical resonator with two outputs that enables the realization of multifunctional logic gates as well as other complex logic operations. As examples, we demonstrate the realization of the fundamental 2-bit logic gates of OR, XOR, AND, NOR, and a half adder. The device is based on a compound resonator consisting of a clamped-guided electrostatically actuated arch beam that is attached to another resonant beam from the side, which serves as an additional actuation electrode for the arch. The structure is also provided with an additional electrothermal tuning capability. The logic operations are based on the linear frequency modulations of the arch resonator and side microbeam. The device is compatible with CMOS fabrication process and works at room temperature
A Description Logic Based Knowledge Representation Model for Concept Understanding
DEFF Research Database (Denmark)
Badie, Farshad
2017-01-01
This research employs Description Logics in order to focus on logical description and analysis of the phenomenon of ‘concept understanding’. The article will deal with a formal-semantic model for figuring out the underlying logical assumptions of ‘concept understanding’ in knowledge representation...... systems. In other words, it attempts to describe a theoretical model for concept understanding and to reflect the phenomenon of ‘concept understanding’ in terminological knowledge representation systems. Finally, it will design an ontology that schemes the structure of concept understanding based...
The Role of Institutional Logics in Shaping Architecture Governance
DEFF Research Database (Denmark)
Andersen, Peter; Svejvig, Per; Carugati, Andrea
2016-01-01
are discussed in relation to current practice and theory on both architecture and IT governance. Generally, the findings show how architecture governance is shaped through a complex, contextual and social process beyond rational, managerial decision-making. Finally, we propose that institutional logics can...... to IT governance literature in general. IT governance is often described as a management prerogative, however, using institutional logics as a theoretical lens and sensitizing device, we show how different logics emerged over time and influenced how the organization governed its architecture. These findings...
Energy Technology Data Exchange (ETDEWEB)
Pohl, S.E.
2007-07-01
The thesis presents the modeling and simulation of a novel development in the field of free-piston engines and the experimental investigation of controllable gas springs. The free-piston linear alternator proposed by the German Aerospace Center (DLR) - Institute of Vehicle Concepts (IFK) combines a two stroke combustion engine with a linear alternator. An adjustable gas spring is used to reset the piston assembly. The engine is designed to enable new degrees of freedom for advanced optimization of the combustion process. In contrast to conventional crankshaft engines, the free-piston design offers mainly two degrees of freedom to improve engine performance: a variable piston stroke and a variable compression ratio. These key features allow for designing a combustion process with low emissions. The variable stroke and variable compression ratio can be used to optimize the combustion process for part load conditions. The goal is to achieve a compact electric power engine with high efficiency and reduced emissions. The free-piston linear alternator aims towards automotive application as auxiliary power unit and as power generator in hybrid electric vehicles. To study the features of free-piston engines this thesis provides a Modelica library containing basic and advanced component models. Control strategies are developed and the dynamic system behavior is characterized through parameter variations. The second part of the thesis examines two gas spring concepts allowing adjustable spring constants during engine operation. The gas spring concepts are theoretically and experimentally investigated. The experimental data is discussed and compared to simulation results. (orig.)
Quantum Logic and Quantum Reconstruction
Stairs, Allen
2015-01-01
Quantum logic understood as a reconstruction program had real successes and genuine limitations. This paper offers a synopsis of both and suggests a way of seeing quantum logic in a larger, still thriving context.
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Hybrid logic is an extension of modal logic which allows us to refer explicitly to points of the model in the syntax of formulas. It is easy to justify interest in hybrid logic on applied grounds, with the usefulness of the additional expressive power. For example, when reasoning about time one...... often wants to build up a series of assertions about what happens at a particular instant, and standard modal formalisms do not allow this. What is less obvious is that the route hybrid logic takes to overcome this problem often actually improves the behaviour of the underlying modal formalism....... For example, it becomes far simpler to formulate proof-systems for hybrid logic, and completeness results can be proved of a generality that is simply not available in modal logic. That is, hybridization is a systematic way of remedying a number of known deficiencies of modal logic. First-order hybrid logic...
Logical analysis of biological systems
DEFF Research Database (Denmark)
Mardare, Radu Iulian
2005-01-01
R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005.......R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005....
Probabilistic logics and probabilistic networks
Haenni, Rolf; Wheeler, Gregory; Williamson, Jon; Andrews, Jill
2014-01-01
Probabilistic Logic and Probabilistic Networks presents a groundbreaking framework within which various approaches to probabilistic logic naturally fit. Additionally, the text shows how to develop computationally feasible methods to mesh with this framework.
Wansing, Heinrich; Willkommen, Caroline; Recent Trends in Philosophical Logic
2014-01-01
This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism, and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University ...
Preferential reasoning for modal logics
CSIR Research Space (South Africa)
Britz, K
2011-11-01
Full Text Available Modal logic is the foundation for a versatile and well-established class of knowledge representation formalisms in artificial intelligence. Enriching modal logics with non-monotonic reasoning capabilities such as preferential reasoning as developed...
Enzymatic AND logic gates operated under conditions characteristic of biomedical applications.
Melnikov, Dmitriy; Strack, Guinevere; Zhou, Jian; Windmiller, Joshua Ray; Halámek, Jan; Bocharova, Vera; Chuang, Min-Chieh; Santhosh, Padmanabhan; Privman, Vladimir; Wang, Joseph; Katz, Evgeny
2010-09-23
Experimental and theoretical analyses of the lactate dehydrogenase and glutathione reductase based enzymatic AND logic gates in which the enzymes and their substrates serve as logic inputs are performed. These two systems are examples of the novel, previously unexplored class of biochemical logic gates that illustrate potential biomedical applications of biochemical logic. They are characterized by input concentrations at logic 0 and 1 states corresponding to normal and pathophysiological conditions. Our analysis shows that the logic gates under investigation have similar noise characteristics. Both significantly amplify random noise present in inputs; however, we establish that for realistic widths of the input noise distributions, it is still possible to differentiate between the logic 0 and 1 states of the output. This indicates that reliable detection of pathophysiological conditions is indeed possible with such enzyme logic systems.
From Logical to Distributional Models
Directory of Open Access Journals (Sweden)
Anne Preller
2014-12-01
Full Text Available The paper relates two variants of semantic models for natural language, logical functional models and compositional distributional vector space models, by transferring the logic and reasoning from the logical to the distributional models. The geometrical operations of quantum logic are reformulated as algebraic operations on vectors. A map from functional models to vector space models makes it possible to compare the meaning of sentences word by word.
Heuristic Synthesis of Reversible Logic – A Comparative Study
Directory of Open Access Journals (Sweden)
Chua Shin Cheng
2014-01-01
Full Text Available Reversible logic circuits have been historically motivated by theoretical research in low-power, and recently attracted interest as components of the quantum algorithm, optical computing and nanotechnology. However due to the intrinsic property of reversible logic, traditional irreversible logic design and synthesis methods cannot be carried out. Thus a new set of algorithms are developed correctly to synthesize reversible logic circuit. This paper presents a comprehensive literature review with comparative study on heuristic based reversible logic synthesis. It reviews a range of heuristic based reversible logic synthesis techniques reported by researchers (BDD-based, cycle-based, search-based, non-search-based, rule-based, transformation-based, and ESOP-based. All techniques are described in detail and summarized in a table based on their features, limitation, library used and their consideration metric. Benchmark comparison of gate count and quantum cost are analysed for each synthesis technique. Comparing the synthesis algorithm outputs over the years, it can be observed that different approach has been used for the synthesis of reversible circuit. However, the improvements are not significant. Quantum cost and gate count has improved over the years, but arguments and debates are still on certain issues such as the issue of garbage outputs that remain the same. This paper provides the information of all heuristic based synthesis of reversible logic method proposed over the years. All techniques are explained in detail and thus informative for new reversible logic researchers and bridging the knowledge gap in this area.
Modal Logics for Cryptographic Processes
DEFF Research Database (Denmark)
Frendrup, U.; Huttel, Hans; Jensen, N. J.
2002-01-01
We present three modal logics for the spi-calculus and show that they capture strong versions of the environment sensitive bisimulation introduced by Boreale et al. Our logics differ from conventional modal logics for process calculi in that they allow us to describe the knowledge of an attacker ...
Combining Paraconsistent Logic with Argumentation
Grooters, Diana; Prakken, Hendrik
2014-01-01
One tradition in the logical study of argumentation is to allow for arguments that combine strict and defeasible inference rules, and to derive the strict inference rules from a logic at least as strong as classical logic. An unsolved problem in this tradition is how the trivialising effect of the
Lectures on Logic and Computation
DEFF Research Database (Denmark)
The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers fo...
Strong Completeness for Markovian Logics
DEFF Research Database (Denmark)
Kozen, Dexter; Mardare, Radu Iulian; Panangaden, Prakash
2013-01-01
In this paper we present Hilbert-style axiomatizations for three logics for reasoning about continuous-space Markov processes (MPs): (i) a logic for MPs defined for probability distributions on measurable state spaces, (ii) a logic for MPs defined for sub-probability distributions and (iii) a log...
Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions
DEFF Research Database (Denmark)
Bresolin, Davide; Goranko, Valentin; Montanari, Angelo
2009-01-01
In this paper, we investigate the expressiveness of the variety of propositional interval neighborhood logics (PNL), we establish their decidability on linearly ordered domains and some important subclasses, and we prove the undecidability of a number of extensions of PNL with additional modalities...... over interval relations. All together, we show that PNL form a quite expressive and nearly maximal decidable fragment of Halpern–Shoham’s interval logic HS....
Mixing Categories and Modal Logics in the Quantum Setting
Cinà, Giovanni
The study of the foundations of Quantum Mechanics, especially after the advent of Quantum Computation and Information, has benefited from the application of category-theoretic tools and modal logics to the analysis of Quantum processes: we witness a wealth of theoretical frameworks casted in either of the two languages. This paper explores the interplay of the two formalisms in the peculiar context of Quantum Theory. After a review of some influential abstract frameworks, we show how different modal logic frames can be extracted from the category of finite dimensional Hilbert spaces, connecting the Categorical Quantum Mechanics approach to some modal logics that have been proposed for Quantum Computing. We then apply a general version of the same technique to two other categorical frameworks, the `topos approach' of Doering and Isham and the sheaf-theoretic work on contextuality by Abramsky and Brandenburger, suggesting how some key features can be expressed with modal languages.
Modern Logical Frameworks Design
DEFF Research Database (Denmark)
Murawska, Agata Anna
2017-01-01
lack support for reasoning about, or programming with, the mechanised systems. Our main motivation is to eventually make it possible to model and reason about complex concurrent systems and protocols. No matter the application, be it the development of a logic for multiparty session types...... or a cryptographic protocol used in a voting system, we need the ability to model and reason about both the building blocks of these systems and the intricate connections between them. To this end, this dissertation is an investigation into LF-based formalisms that might help address the aforementioned issues. We...... design and provide the meta-theory of two new frameworks, HyLF and Lincx. The former aims to extend the expressiveness of LF to include proof irrelevance and some user-defined behaviours, using ideas from hybrid logics. The latter is a showcase for an easier to implement framework, while also allowing...
Competing Logics and Healthcare
Saks, Mike
2018-01-01
This paper offers a short commentary on the editorial by Mannion and Exworthy. The paper highlights the positive insights offered by their analysis into the tensions between the competing institutional logics of standardization and customization in healthcare, in part manifested in the conflict between managers and professionals, and endorses the plea of the authors for further research in this field. However, the editorial is criticized for its lack of a strong societal reference point, the comparative absence of focus on hybridization, and its failure to highlight structural factors impinging on the opposing logics in a broader neo-institutional framework. With reference to the Procrustean metaphor, it is argued that greater stress should be placed on the healthcare user in future health policy. Finally, the case of complementary and alternative medicine is set out which – while not explicitly mentioned in the editorial – most effectively concretizes the tensions at the heart of this analysis of healthcare. PMID:29626406
Directory of Open Access Journals (Sweden)
Douglas Walton
2015-12-01
Full Text Available This paper presents a formalization of informal logic using the Carneades Argumentation System (CAS, a formal, computational model of argument that consists of a formal model of argument graphs and audiences. Conflicts between pro and con arguments are resolved using proof standards, such as preponderance of the evidence. CAS also formalizes argumentation schemes. Schemes can be used to check whether a given argument instantiates the types of argument deemed normatively appropriate for the type of dialogue.
Probabilistic Logical Characterization
DEFF Research Database (Denmark)
Hermanns, Holger; Parma, Augusto; Segala, Roberto
2011-01-01
Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance...... modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata....
Stereotypical Reasoning: Logical Properties
Lehmann, Daniel
2002-01-01
Stereotypical reasoning assumes that the situation at hand is one of a kind and that it enjoys the properties generally associated with that kind of situation. It is one of the most basic forms of nonmonotonic reasoning. A formal model for stereotypical reasoning is proposed and the logical properties of this form of reasoning are studied. Stereotypical reasoning is shown to be cumulative under weak assumptions.
International Nuclear Information System (INIS)
Mukhanov, O.A.; Rylov, S.V.; Semenov, V.K.; Vyshenskii, S.V.
1989-01-01
Several ways of local timing of the Josephson-junction RSFQ (Rapid Single Flux Quantum) logic elements are proposed, and their peculiarities are discussed. Several examples of serial and parallel pipelined arithmetic blocks using various types of timing are suggested and their possible performance is discussed. Serial devices enable one to perform n-bit functions relatively slowly but using integrated circuits of a moderate integration scale, while parallel pipelined devices are more hardware-wasteful but promise extremely high productivity
1981-01-01
Rapport, Groupe Intelligence Pasero, R., Artificielle , Universite d’Aix-Marseille, Roussel, P. Luminy, France, 1973. [Kowalski 1974] Kowalski, R. A...THIS PAGZ(Whan Doee Es tMord) Item 20 (Cont’d) ------ work in the area of artificial intelligence and those used in general program development into a...logic programming with LISP for implementing intelligent data base query systems. Continued developments will allow for enhancements to be made to the
Magnetoresistive logic and biochip
International Nuclear Information System (INIS)
Brueckl, Hubert; Brzeska, Monika; Brinkmann, Dirk; Schotter, J.Joerg; Reiss, Guenter; Schepper, Willi; Kamp, P.-B.; Becker, Anke
2004-01-01
While some magnetoresistive devices based on giant magnetoresistance or spin-dependent tunneling are already commercialized, a new branch of development is evolving towards magnetoresistive logic with magnetic tunnel junctions. Furthermore, the new magnetoelectronic effects show promising properties in magnetoresistive biochips, which are capable of detecting even single molecules (e.g. DNA) by functionalized magnetic markers. The unclear limits of this approach are discussed with two model systems
A Paraconsistent Higher Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen
2004-01-01
of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order...... of the logic is examined by a case study in the domain of medicine. Thus we try to build a bridge between the HOL and MVL communities. A sequent calculus is proposed based on recent work by Muskens. Many non-classical logics are, at the propositional level, funny toys which work quite good, but when one wants...
Active matter logic for autonomous microfluidics
Woodhouse, Francis G.; Dunkel, Jörn
2017-04-01
Chemically or optically powered active matter plays an increasingly important role in materials design, but its computational potential has yet to be explored systematically. The competition between energy consumption and dissipation imposes stringent physical constraints on the information transport in active flow networks, facilitating global optimization strategies that are not well understood. Here, we combine insights from recent microbial experiments with concepts from lattice-field theory and non-equilibrium statistical mechanics to introduce a generic theoretical framework for active matter logic. Highlighting conceptual differences with classical and quantum computation, we demonstrate how the inherent non-locality of incompressible active flow networks can be utilized to construct universal logical operations, Fredkin gates and memory storage in set-reset latches through the synchronized self-organization of many individual network components. Our work lays the conceptual foundation for developing autonomous microfluidic transport devices driven by bacterial fluids, active liquid crystals or chemically engineered motile colloids.
International Nuclear Information System (INIS)
Jung, Kyu-Nam; Pyun, Su-Il
2007-01-01
Lithium transport through the partially inactive fractal Li 1-δ Mn 2 O 4 film electrode under the cell-impedance-controlled constraint was theoretically investigated by using the kinetic Monte Carlo method based upon random walk approach. Under the cell-impedance-controlled constraint, all the potentiostatic current transients calculated from the totally active and partially inactive fractal electrodes hardly exhibited the generalised Cottrell behaviour and they were significantly affected in shape by the interfacial charge-transfer kinetics. In the case of the linear sweep voltammogram determined from the totally active and partially inactive fractal electrodes, all the power dependence of the peak current on the scan rate above the characteristic scan rate deviated from the generalised Randles-Sevcik behaviour. From the analyses of the current transients and the linear sweep voltammograms simulated with various values of the simulation parameters, it was further recognised that the cell-impedance-controlled lithium transport through the partially inactive fractal Li 1-δ Mn 2 O 4 film electrode strongly deviates from the generalised diffusion-controlled transport behaviour of the electrode with the totally active surface, which is attributed to the impeded interfacial charge-transfer kinetics governed by the surface inhomogeneities including the fractal dimension of the surface and the surface coverage by active sites and by the kinetic parameters including the internal cell resistance
Logic circuits based on molecular spider systems.
Mo, Dandan; Lakin, Matthew R; Stefanovic, Darko
2016-08-01
Spatial locality brings the advantages of computation speed-up and sequence reuse to molecular computing. In particular, molecular walkers that undergo localized reactions are of interest for implementing logic computations at the nanoscale. We use molecular spider walkers to implement logic circuits. We develop an extended multi-spider model with a dynamic environment wherein signal transmission is triggered via localized reactions, and use this model to implement three basic gates (AND, OR, NOT) and a cascading mechanism. We develop an algorithm to automatically generate the layout of the circuit. We use a kinetic Monte Carlo algorithm to simulate circuit computations, and we analyze circuit complexity: our design scales linearly with formula size and has a logarithmic time complexity. Copyright © 2016 Elsevier Ireland Ltd. All rights reserved.
Computability, complexity, logic
Börger, Egon
1989-01-01
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes an
T Atanassov, Krassimir
2017-01-01
The book offers a comprehensive survey of intuitionistic fuzzy logics. By reporting on both the author’s research and others’ findings, it provides readers with a complete overview of the field and highlights key issues and open problems, thus suggesting new research directions. Starting with an introduction to the basic elements of intuitionistic fuzzy propositional calculus, it then provides a guide to the use of intuitionistic fuzzy operators and quantifiers, and lastly presents state-of-the-art applications of intuitionistic fuzzy sets. The book is a valuable reference resource for graduate students and researchers alike.
Basavanagowda Nagabhushana, Nandeesh
2014-01-01
Brown plant hopper showed me the way into organic farming. In 2001, I started my practice with logic of legumes just to cut down the 45 percent expenses of my paddy on fertilizers, pesticides and herbicides. Later as I realized each and every plant carries it’s own nutrients, medicinal values and characters. Plants like millets, oil seeds, spices, di-cots, monocots and weeds all being used as a green manure. For all my agriculture problems and crop demands, I look for the answers only thro...
DEFF Research Database (Denmark)
Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker
2012-01-01
We present a logical relation for showing the correctness of program transformations based on a new type-and-eﬀect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number....... To the best of our knowledge, this is the ﬁrst such result for a concurrent higher-order language with higher-order store and dynamic memory allocation....
Krötzsch, M
2010-01-01
Ontological modelling today is applied in many areas of science and technology,including the Semantic Web. The W3C standard OWL defines one of the most important ontology languages based on the semantics of description logics. An alternative is to use rule languages in knowledge modelling, as proposed in the W3C's RIF standard. So far, it has often been unclear how to combine both technologies without sacrificing essential computational properties. This book explains this problem and presents new solutions that have recently been proposed. Extensive introductory chapters provide the necessary
Bright, Liam Kofi
2017-10-01
The logical empiricists expressed a consistent attitude to racial categorisation in both the ethical and scientific spheres. Their attitude may be captured in the following slogan: human racial taxonomy is an empirically meaningful mode of classifying persons that we should refrain from deploying. I offer an interpretation of their position that would render coherent their remarks on race with positions they adopted on the scientific status of taxonomy in general, together with their potential moral or political motivations for adopting that position. Copyright © 2017 Elsevier Ltd. All rights reserved.
Flexible programmable logic module
Robertson, Perry J.; Hutchinson, Robert L.; Pierson, Lyndon G.
2001-01-01
The circuit module of this invention is a VME board containing a plurality of programmable logic devices (PLDs), a controlled impedance clock tree, and interconnecting buses. The PLDs are arranged to permit systolic processing of a problem by offering wide data buses and a plurality of processing nodes. The board contains a clock reference and clock distribution tree that can drive each of the PLDs with two critically timed clock references. External clock references can be used to drive additional circuit modules all operating from the same synchronous clock reference.
Reprogrammable logic in memristive crossbar for in-memory computing
Cheng, Long; Zhang, Mei-Yun; Li, Yi; Zhou, Ya-Xiong; Wang, Zhuo-Rui; Hu, Si-Yu; Long, Shi-Bing; Liu, Ming; Miao, Xiang-Shui
2017-12-01
Memristive stateful logic has emerged as a promising next-generation in-memory computing paradigm to address escalating computing-performance pressures in traditional von Neumann architecture. Here, we present a nonvolatile reprogrammable logic method that can process data between different rows and columns in a memristive crossbar array based on material implication (IMP) logic. Arbitrary Boolean logic can be executed with a reprogrammable cell containing four memristors in a crossbar array. In the fabricated Ti/HfO2/W memristive array, some fundamental functions, such as universal NAND logic and data transfer, were experimentally implemented. Moreover, using eight memristors in a 2 × 4 array, a one-bit full adder was theoretically designed and verified by simulation to exhibit the feasibility of our method to accomplish complex computing tasks. In addition, some critical logic-related performances were further discussed, such as the flexibility of data processing, cascading problem and bit error rate. Such a method could be a step forward in developing IMP-based memristive nonvolatile logic for large-scale in-memory computing architecture.
Coherence Generalises Duality: A Logical Explanation of Multiparty Session Types
DEFF Research Database (Denmark)
Carbone, Marco; Lindley, Sam; Montesi, Fabrizio
2016-01-01
the duality of classical linear logic (relating two types) with a more general notion of coherence (relating an arbitrary number of types). This paper introduces variants of CP and MCP, plus a new intermediate calculus of Globally-governed Classical Processes (GCP). We show a tight relation between......Wadler introduced Classical Processes (CP), a calculus based on a propositions-as-types correspondence between propositions of classical linear logic and session types. Carbone et al. introduced Multiparty Classical Processes, a calculus that generalises CP to multiparty session types, by replacing...
Superconducting digital logic amplifier
International Nuclear Information System (INIS)
Przybysz, J.X.
1989-01-01
This paper describes a superconducting digital logic amplifier for interfacing between a Josephson junction logic circuit having output current and a higher voltage semiconductor circuit input. The amplifier comprising: an input terminal for connection to a; an output terminal for connection to a semiconductor circuit input; an input, lower critical current, Josephson junction having first and second terminals; a first series string of at least three lower critical current Josephson junctions. The first series string being connected to the first terminal of the input Josephson junction such that the first series string is in series with the input Josephson junction to provide a series combination. The input terminal being connected to the first terminal of the input Josephson junction, and with the critical current of the lower critical current Josephson junctions of the input Josephson junction and the first series Josephson junctions being less than the output current of the low voltage Josephson junction circuit; a second series string of at least four higher critical current Josephson junctions. The second string being connected in parallel with the series combination to provide parallel strings having an upper common connection and a lower common connection. The lower common connection being connected to the second terminal of the input Josephson junction and the upper common connection being connected to the output terminal; and a pulsed DC current source connected the parallel strings at the upper common connection. The DC current source having a current at least equal to the critical current of the higher critical current Josephson junctions
Quantum logics and convex geometry
International Nuclear Information System (INIS)
Bunce, L.J.; Wright, J.D.M.
1985-01-01
The main result is a representation theorem which shows that, for a large class of quantum logics, a quantum logic, Q, is isomorphic to the lattice of projective faces in a suitable convex set K. As an application we extend our earlier results, which, subject to countability conditions, gave a geometric characterization of those quantum logics which are isomorphic to the projection lattice of a von Neumann algebra or a JBW-algebra. (orig.)
International Nuclear Information System (INIS)
Sambasivan, S. Ilango
2004-01-01
Full text : PFBR is provided with two independent, fast acting and diverse shutdown systems to detect any abnormalities and to initiate safety action. Each system consists of sensors, signal processing systems, logics, drive mechanisms and absorber rods. The absorber rods of the first system are Control and Safety Rods (CSR) and that of the second are called as Diverse Safety Rods (DSR). There are nine CSR and three DSR. While CSR are used for startup, control of reactor power, controlled shutdown and SCRAM, the DSR are used only for SCRAM. The respective drive mechanisms are called as CSRDM and DSRDM. Each of these two systems is capable of executing the shutdown satisfactorily with single failure criteria. Two independent safety logic systems based on diverse principles have been designed for the two shut down systems. The analog outputs of the sensors of Core Monitoring Systems comprising of reactor flux monitoring, core temperature monitoring, failed fuel detection and core flow monitoring systems are processed and converted into binary signals depending on their instantaneous values. Safety logic systems receive the binary signals from these core-monitoring systems and process them logically to protect the reactor against postulated initiating events. Neutronic and power to flow (P/Q) signals form the inputs to safety logic system-I and temperature signals are inputs to the safety logic system II. Failed fuel detection signals are processed by both the shut down systems. The two logic systems to actuate the safety rods are also based on two diverse designs and implemented with solid-state devices to meet all the requirements of safety systems. Safety logic system I that caters to neutronic and P/Q signals is designed around combinational logic and has an on-line test facility to detect struck at faults. The second logic system is based on dynamic logic and hence is inherently safe. This paper gives an overview of the two logic systems that have been
PM 3655 PHILIPS Logic analyzer
A logic analyzer is an electronic instrument that captures and displays multiple signals from a digital system or digital circuit. A logic analyzer may convert the captured data into timing diagrams, protocol decodes, state machine traces, assembly language, or may correlate assembly with source-level software. Logic Analyzers have advanced triggering capabilities, and are useful when a user needs to see the timing relationships between many signals in a digital system.
Contextual logic for quantum systems
International Nuclear Information System (INIS)
Domenech, Graciela; Freytes, Hector
2005-01-01
In this work we build a quantum logic that allows us to refer to physical magnitudes pertaining to different contexts from a fixed one without the contradictions with quantum mechanics expressed in no-go theorems. This logic arises from considering a sheaf over a topological space associated with the Boolean sublattices of the ortholattice of closed subspaces of the Hilbert space of the physical system. Different from standard quantum logics, the contextual logic maintains a distributive lattice structure and a good definition of implication as a residue of the conjunction
Tensor product of quantum logics
Pulmannová, Sylvia
1985-01-01
A quantum logic is the couple (L,M) where L is an orthomodular σ-lattice and M is a strong set of states on L. The Jauch-Piron property in the σ-form is also supposed for any state of M. A ``tensor product'' of quantum logics is defined. This definition is compared with the definition of a free orthodistributive product of orthomodular σ-lattices. The existence and uniqueness of the tensor product in special cases of Hilbert space quantum logics and one quantum and one classical logic are studied.
DEFF Research Database (Denmark)
A.N. Prior (1914-69) in the course of the 1950s and 1960s founded a new and revolutionary paradigm in philosophy and logic. Its most central feature is the preoccupation with time and the development of the logic of time. However, this was inseparably interwoven with fundamental questions about h...... human freedom, ethics, and existence. This remarkable integration of themes also embodies an original and in fact revolutionary conception of logic. The book series, Logic and Philosophy of Time, is dedicated to a deep investigation and also the further development of Prior’s paradigm. ...
Optimization methods for logical inference
Chandru, Vijay
2011-01-01
Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in
DEFF Research Database (Denmark)
By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s).......By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s)....
Strategic Reasoning in Interdependence: Logical and Game-Theoretical Investigations
Turrini, P.
2011-01-01
Game theory is the branch of economics that studies interactive decision making, i.e. how entities that can reasonably be described as players of a game should behave, given their preferences and their information. Game theory is usually divided into two main branches: non-cooperative game theory,
Meta-Logical Reasoning in Higher-Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen; Schlichtkrull, Anders; Hess, Andreas Viktor
The semantics of first-order logic (FOL) can be described in the meta-language of higher-order logic (HOL). Using HOL one can prove key properties of FOL such as soundness and completeness. Furthermore, one can prove sentences in FOL valid using the formalized FOL semantics. To aid...
Compendium of theoretical physics
Wachter, Armin
2006-01-01
Mechanics, Electrodynamics, Quantum Mechanics, and Statistical Mechanics and Thermodynamics comprise the canonical undergraduate curriculum of theoretical physics. In Compendium of Theoretical Physics, Armin Wachter and Henning Hoeber offer a concise, rigorous and structured overview that will be invaluable for students preparing for their qualifying examinations, readers needing a supplement to standard textbooks, and research or industrial physicists seeking a bridge between extensive textbooks and formula books. The authors take an axiomatic-deductive approach to each topic, starting the discussion of each theory with its fundamental equations. By subsequently deriving the various physical relationships and laws in logical rather than chronological order, and by using a consistent presentation and notation throughout, they emphasize the connections between the individual theories. The reader’s understanding is then reinforced with exercises, solutions and topic summaries. Unique Features: Every topic is ...
Quantum Enhanced Inference in Markov Logic Networks.
Wittek, Peter; Gogolin, Christian
2017-04-19
Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.
Quantum Enhanced Inference in Markov Logic Networks
Wittek, Peter; Gogolin, Christian
2017-04-01
Markov logic networks (MLNs) reconcile two opposing schools in machine learning and artificial intelligence: causal networks, which account for uncertainty extremely well, and first-order logic, which allows for formal deduction. An MLN is essentially a first-order logic template to generate Markov networks. Inference in MLNs is probabilistic and it is often performed by approximate methods such as Markov chain Monte Carlo (MCMC) Gibbs sampling. An MLN has many regular, symmetric structures that can be exploited at both first-order level and in the generated Markov network. We analyze the graph structures that are produced by various lifting methods and investigate the extent to which quantum protocols can be used to speed up Gibbs sampling with state preparation and measurement schemes. We review different such approaches, discuss their advantages, theoretical limitations, and their appeal to implementations. We find that a straightforward application of a recent result yields exponential speedup compared to classical heuristics in approximate probabilistic inference, thereby demonstrating another example where advanced quantum resources can potentially prove useful in machine learning.
Towards an arithmetical logic the arithmetical foundations of logic
Gauthier, Yvon
2015-01-01
This book offers an original contribution to the foundations of logic and mathematics, and focuses on the internal logic of mathematical theories, from arithmetic or number theory to algebraic geometry. Arithmetical logic is the term used to refer to the internal logic of classical arithmetic, here called Fermat-Kronecker arithmetic, and combines Fermat’s method of infinite descent with Kronecker’s general arithmetic of homogeneous polynomials. The book also includes a treatment of theories in physics and mathematical physics to underscore the role of arithmetic from a constructivist viewpoint. The scope of the work intertwines historical, mathematical, logical and philosophical dimensions in a unified critical perspective; as such, it will appeal to a broad readership from mathematicians to logicians, to philosophers interested in foundational questions. Researchers and graduate students in the fields of philosophy and mathematics will benefit from the author’s critical approach to the foundations of l...
Quantum Logic: Approach a Child's Environment from "Inside."
Rhodes, William C.
1987-01-01
With the advent of quantum mechanics, physics has merged with psychology, and cognitive science has been revolutionized. Quantum logic supports the notion of influencing the environment by increasing the child's capacity for cognitive processing. This special educational approach is theoretically more effective than social and political…
Fuzzy Logic and Arithmetical Hierarchy III
Czech Academy of Sciences Publication Activity Database
Hájek, Petr
2001-01-01
Roč. 68, č. 1 (2001), s. 129-142 ISSN 0039-3215 R&D Projects: GA AV ČR IAA1030004 Institutional research plan: AV0Z1030915 Keywords : fuzzy logic * basic fuzzy logic * Lukasiewicz logic * Godel logic * product logic * arithmetical hierarchy Subject RIV: BA - General Mathematics
Logical entropy of quantum dynamical systems
Directory of Open Access Journals (Sweden)
Ebrahimzadeh Abolfazl
2016-01-01
Full Text Available This paper introduces the concepts of logical entropy and conditional logical entropy of hnite partitions on a quantum logic. Some of their ergodic properties are presented. Also logical entropy of a quantum dynamical system is dehned and ergodic properties of dynamical systems on a quantum logic are investigated. Finally, the version of Kolmogorov-Sinai theorem is proved.
Questions and dependency in intuitionistic logic
Ciardelli, Ivano; Iemhoff, Rosalie; Yang, Fan
2017-01-01
In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of statements, and added formulas expressing questions and
Reversible logic gates on Physarum Polycephalum
International Nuclear Information System (INIS)
Schumann, Andrew
2015-01-01
In this paper, we consider possibilities how to implement asynchronous sequential logic gates and quantum-style reversible logic gates on Physarum polycephalum motions. We show that in asynchronous sequential logic gates we can erase information because of uncertainty in the direction of plasmodium propagation. Therefore quantum-style reversible logic gates are more preferable for designing logic circuits on Physarum polycephalum
A beginner's guide to mathematical logic
Smullyan, Raymond M
2014-01-01
Combining stories of great philosophers, quotations, and riddles with the fundamentals of mathematical logic, this new textbook for first courses in mathematical logic was written by the subject's creative master. Raymond Smullyan offers clear, incremental presentations of difficult logic concepts with creative explanations and unique problems related to proofs, propositional logic and first-order logic, undecidability, recursion theory, and other topics.
Structural Completeness in Fuzzy Logics
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Metcalfe, G.
2009-01-01
Roč. 50, č. 2 (2009), s. 153-183 ISSN 0029-4527 R&D Projects: GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : structral logics * fuzzy logics * structural completeness * admissible rules * primitive variety * residuated lattices Subject RIV: BA - General Mathematics
A tristate optical logic system
Basuray, A.; Mukhopadhyay, S.; Kumar Ghosh, Hirak; Datta, A. K.
1991-09-01
A method is described to represent data in a tristate logic system which are subsequently replaced by Modified Trinary Numbers (MTN). This system is advantagegeous in parallel processing as carry and borrow free operations in arithmatic computation is possible. The logical operations are also modified according to the three states available. A possible practical application of the same using polarized light is also suggested.
Logic, reasoning, and verbal behavior
Terrell, Dudley J.; Johnston, J. M.
1989-01-01
This paper analyzes the traditional concepts of logic and reasoning from the perspective of radical behaviorism and in the terms of Skinner's treatment of verbal behavior. The topics covered in this analysis include the proposition, premises and conclusions, logicality and rules, and deductive and inductive reasoning.
Flat Coalgebraic Fixed Point Logics
Schröder, Lutz; Venema, Yde
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the μ-calculus. The family of such flat fixed point logics includes, e.g., CTL, the *-nesting-free fragment of PDL, and the logic of common knowledge. Here, we extend this notion to the generic semantic framework of coalgebraic logic, thus covering a wide range of logics beyond the standard μ-calculus including, e.g., flat fragments of the graded μ-calculus and the alternating-time μ-calculus (such as ATL), as well as probabilistic and monotone fixed point logics. Our main results are completeness of the Kozen-Park axiomatization and a timed-out tableaux method that matches ExpTime upper bounds inherited from the coalgebraic μ-calculus but avoids using automata.
Evidence logics with relational evidence
DEFF Research Database (Denmark)
Baltag, Alexandru; Occhipinti, Andrés
2017-01-01
We introduce a family of logics for reasoning about relational evidence: evidence that involves an ordering of states in terms of their relative plausibility. We provide sound and complete axiomatizations for the logics. We also present several evidential actions and prove soundness...
Methods in Logic Based Control
DEFF Research Database (Denmark)
Christensen, Georg Kronborg
1999-01-01
Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...
Epistemic logics for sceptical agents
Czech Academy of Sciences Publication Activity Database
Bílková, M.; Majer, Ondrej; Peliš, Michal
2016-01-01
Roč. 26, č. 6 (2016), s. 1815-1841 ISSN 0955-792X R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : epistemic logic * substructural logic * frame semantics Subject RIV: AA - Philosophy ; Religion Impact factor: 0.909, year: 2016
International Nuclear Information System (INIS)
Zapatrin, R.R.
1992-01-01
Given a finite ortholattice L, the *-semigroup is explicitly built whose annihilator ortholattice is isomorphic to L. Thus, it is shown that any finite quantum logic is the additive part of a binary logic. Some areas of possible applications are outlined. 7 refs
Logical independence and quantum randomness
International Nuclear Information System (INIS)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C; Prevedel, R; Klimek, P
2010-01-01
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Generator of combined logical signals
International Nuclear Information System (INIS)
Laviron, Andre; Berard, Claude.
1982-01-01
The invention concerns a generator of combined logical signals to form combinations of two outputs at logical level 1 and N-2 outputs at logical level 0, among N generator outputs. This generator is characterized in that it includes a set of N means for storing combinations. Means enable the N storage means to be loaded with the logical levels corresponding to a pre-set starting combination, to control the operations for shifting the contents of the storage means and to control, by transfer facilities, the transfers of contents between these storage means. Controls enable the storage means to be actuated in order to obtain combinations of logical levels 1 and 0. The generation of combinations can be stopped after another pre-set combination. Application is for testing of safety circuits for nuclear power stations [fr
Reliability evaluation programmable logic devices
International Nuclear Information System (INIS)
Srivani, L.; Murali, N.; Thirugnana Murthy, D.; Satya Murty, S.A.V.
2014-01-01
Programmable Logic Devices (PLD) are widely used as basic building modules in high integrity systems, considering their robust features such as gate density, performance, speed etc. PLDs are used to implement digital design such as bus interface logic, control logic, sequencing logic, glue logic etc. Due to semiconductor evolution, new PLDs with state-of-the-art features are arriving to the market. Since these devices are reliable as per the manufacturer's specification, they were used in the design of safety systems. But due to their reduced market life, the availability of performance data is limited. So evaluating the PLD before deploying in a safety system is very important. This paper presents a survey on the use of PLDs in the nuclear domain and the steps involved in the evaluation of PLD using Quantitative Accelerated Life Testing. (author)
Logical independence and quantum randomness
Energy Technology Data Exchange (ETDEWEB)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C [Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna (Austria); Prevedel, R; Klimek, P [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)], E-mail: tomasz.paterek@univie.ac.at
2010-01-15
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Marketing Logics, Ambidexterity and Influence
DEFF Research Database (Denmark)
Tollin, Karin; Schmidt, Marcus
2012-01-01
in four CMOs have taken on this challenge, or adopted a marketing logic which could be referred to as ambidextrous. Furthermore, the study shows that this logic exerts a stronger impact on marketing's influence, compared to logics related to assuring brand consistency and measuring the performance...... of marketing processes. Three other ways to enact marketing management were also revealed, namely: an innovation; a communication; and a supporting marketing logic. This leads us to conclude that the influence of companies' marketing functions show up a heterogeneous picture within which the marketing logics......The duties of companies' chief marketing officers (CMOs) seem incompatible. They are expected to ensure that their company's market assets are properly exploited and recorded, while simultaneously enacting a proactive role in the company's business development. This study shows that about one...
Optical programmable Boolean logic unit.
Chattopadhyay, Tanay
2011-11-10
Logic units are the building blocks of many important computational operations likes arithmetic, multiplexer-demultiplexer, radix conversion, parity checker cum generator, etc. Multifunctional logic operation is very much essential in this respect. Here a programmable Boolean logic unit is proposed that can perform 16 Boolean logical operations from a single optical input according to the programming input without changing the circuit design. This circuit has two outputs. One output is complementary to the other. Hence no loss of data can occur. The circuit is basically designed by a 2×2 polarization independent optical cross bar switch. Performance of the proposed circuit has been achieved by doing numerical simulations. The binary logical states (0,1) are represented by the absence of light (null) and presence of light, respectively.
Analysing Vote Counting Algorithms Via Logic - And its Application to the CADE Election Scheme
DEFF Research Database (Denmark)
Schürmann, Carsten; Beckert, Bernhard; Gore, Rejeev
2013-01-01
We present a method for using first-order logic to specify the semantics of preferences as used in common vote counting algorithms. We also present a corresponding system that uses Celf linear-logic programs to describe voting algorithms and which generates explicit examples when the algorithm de...
Fuzzy logic control of vehicle suspensions with dry friction nonlinearity
Indian Academy of Sciences (India)
We design and investigate the performance of fuzzy logic-controlled (FLC) active suspensions on a nonlinear vehicle model with four degrees of freedom, without causing any degeneration in suspension working limits. Force actuators were mounted parallel to the suspensions. In this new approach, linear combinations of ...
Non-commutative multiple-valued logic algebras
Ciungu, Lavinia Corina
2014-01-01
This monograph provides a self-contained and easy-to-read introduction to non-commutative multiple-valued logic algebras; a subject which has attracted much interest in the past few years because of its impact on information science, artificial intelligence and other subjects. A study of the newest results in the field, the monograph includes treatment of pseudo-BCK algebras, pseudo-hoops, residuated lattices, bounded divisible residuated lattices, pseudo-MTL algebras, pseudo-BL algebras and pseudo-MV algebras. It provides a fresh perspective on new trends in logic and algebras in that algebraic structures can be developed into fuzzy logics which connect quantum mechanics, mathematical logic, probability theory, algebra and soft computing. Written in a clear, concise and direct manner, Non-Commutative Multiple-Valued Logic Algebras will be of interest to masters and PhD students, as well as researchers in mathematical logic and theoretical computer science.
The Logic of Practice in the Practice of Logics
DEFF Research Database (Denmark)
Raviola, Elena; Dubini, Paola
2016-01-01
of logics through a six months full-time ethnographic study at Il Sole-24 Ore, the largest Italian financial newspaper, between 2007 and 2008. An original conceptual framework is developed to analyse how the logic of journalism is enacted vis-à-vis that of advertising in a setting in which an old technology...... for news production – print newspaper – coexists with a new one – website – and thus encounters between new and old technological possibilities make workings of institutional logics particularly visible. The findings point out different mechanisms of institutional work dealing with actions that, made...
Minimality of critical scenarios with linear logic and cutsets
African Journals Online (AJOL)
DK
establish the causality between undesirable events and normal operations. The proof trees of ... MS (both continuous and discrete features) leads us to choose a ...... Modeling and simulation of hybrid system through. Differential Predicate ...
Basic logic and quantum entanglement
International Nuclear Information System (INIS)
Zizzi, P A
2007-01-01
As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective 'entanglement' in a logical sequent calculus for the machine language? And also, is it possible to 'teach' the quantum computer to 'mimic' the EPR 'paradox'? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective 'entanglement'). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing
Basic logic and quantum entanglement
Energy Technology Data Exchange (ETDEWEB)
Zizzi, P A [Dipartimento di Matematica Pura ed Applicata, Via Trieste 63, 35121 Padova (Italy)
2007-05-15
As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective 'entanglement' in a logical sequent calculus for the machine language? And also, is it possible to 'teach' the quantum computer to 'mimic' the EPR 'paradox'? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective 'entanglement'). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.
Kral, M J
1994-01-01
Although suicide is not viewed as a mental disorder per se, it is viewed by many if not most clinicians, researchers, and lay people as a real or natural symptom of depression. It is at least most typically seen as the unfortunate, severe, yet logical end result of a chain of negative self-appraisals, negative events, and hopelessness. Extending an approach articulated by the early French sociologist Gabriel Tarde, in this paper I argue that suicide is merely an idea, albeit a very bad one, having more in common with societal beliefs and norms regarding such things as divorce, abortion, sex, politics, consumer behavior, and fashion. I make a sharp contrast between perturbation and lethality, concepts central to Edwin S. Shneidman's theory of suicide. Evidence supportive of suicide as an idea is discussed based on what we are learning from the study of history and culture, and about contagion/cluster phenomena, media/communication, and choice of method. It is suggested that certain individuals are more vulnerable to incorporate the idea and act of suicide into their concepts of self, based on the same principles by which ideas are spread throughout society. Just as suicide impacts on society, so does society impact on suicide.
Remmel, Jeffrey; Shore, Richard; Sweedler, Moss; Progress in Computer Science and Applied Logic
1993-01-01
The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematica...
Rethinking logic logic in relation to mathematics, evolution, and method
Cellucci, Carlo
2014-01-01
This book examines the limitations of mathematical logic and proposes a new approach intended to overcome them. Formulates new rules of discovery, such as induction, analogy, generalization, specialization, metaphor, metonymy, definition and diagrams.
Energy Technology Data Exchange (ETDEWEB)
Perulli, M [Commissariat a l' Energie Atomique, Fontenay-aux-Roses (France). Centre d' Etudes Nucleaires
1968-07-01
Using the Vlasov equation we calculate and discuss non-linear coupling equations between three electronic plasma waves (Langmuir waves) which propagate in a cylindrical plasma column confined by a strong magnetic field. We study, in the experimental device EOS, along the magnetic field, the disintegration of a Langmuir wave excited in the plasma column by means of an antenna. Space structure measurements for various waves show that the resonance conditions (selection rules) are satisfied. The measured disintegration threshold is in agreement with the theoretical value within 30 per cent and shows that this non linear mechanism appears when the oscillating density to the mean density ratio is about 10{sup -3} to 10{sup -2}. The variation of the spatial growth rate as a function of the amplitude of the disintegrated wave shows that the resulting waves are correlated in groups of three along the magnetic field even though the disintegrating spectrum appears in a wide frequency band. (author) [French] A partir de l'equation de Vlasov nous calculons et discutons les equations de couplage non lineaire entre trois ondes plasma electroniques (ou ondes de Langmuir) qui se propagent dans une colonne de plasma cylindrique confinee par un champ magnetique de forte intensite. Nous etudions, dans le dispositif experimental EOS, le long du champ magnetique, la desintegration d'une onde de Langmuir excitee dans la colonne de plasma a l'aide d'une antenne. La mesure de la structure spatiale des differentes ondes montre que l'ensemble des conditions de resonance (ou regles de selection) sont satisfaites. Le seuil de desintegration mesure est en accord avec la valeur theorique a 30 pour cent pres et montre que ce mecanisme non lineaire apparait lorsque le rapport de la densite oscillante a la densite moyenne est de l'ordre de 10{sup -3} a 10{sup -2}. La variation du taux de croissance spatiale en fonction de l'amplitude de l'onde qui se desintegre montre que les ondes restent trois
Energy Technology Data Exchange (ETDEWEB)
Perulli, M. [Commissariat a l' Energie Atomique, Fontenay-aux-Roses (France). Centre d' Etudes Nucleaires
1968-07-01
Using the Vlasov equation we calculate and discuss non-linear coupling equations between three electronic plasma waves (Langmuir waves) which propagate in a cylindrical plasma column confined by a strong magnetic field. We study, in the experimental device EOS, along the magnetic field, the disintegration of a Langmuir wave excited in the plasma column by means of an antenna. Space structure measurements for various waves show that the resonance conditions (selection rules) are satisfied. The measured disintegration threshold is in agreement with the theoretical value within 30 per cent and shows that this non linear mechanism appears when the oscillating density to the mean density ratio is about 10{sup -3} to 10{sup -2}. The variation of the spatial growth rate as a function of the amplitude of the disintegrated wave shows that the resulting waves are correlated in groups of three along the magnetic field even though the disintegrating spectrum appears in a wide frequency band. (author) [French] A partir de l'equation de Vlasov nous calculons et discutons les equations de couplage non lineaire entre trois ondes plasma electroniques (ou ondes de Langmuir) qui se propagent dans une colonne de plasma cylindrique confinee par un champ magnetique de forte intensite. Nous etudions, dans le dispositif experimental EOS, le long du champ magnetique, la desintegration d'une onde de Langmuir excitee dans la colonne de plasma a l'aide d'une antenne. La mesure de la structure spatiale des differentes ondes montre que l'ensemble des conditions de resonance (ou regles de selection) sont satisfaites. Le seuil de desintegration mesure est en accord avec la valeur theorique a 30 pour cent pres et montre que ce mecanisme non lineaire apparait lorsque le rapport de la densite oscillante a la densite moyenne est de l'ordre de 10{sup -3} a 10{sup -2}. La variation du taux de croissance spatiale en fonction de l'amplitude de l'onde qui se
The conditional in quantum logic
International Nuclear Information System (INIS)
Hardegree, G.M.
1976-01-01
In this article it is argued that orthodox quantum logic, which is represented by the lattice of projections on Hilbert space, does in fact admit an operation which possesses the essential properties of a material conditional. It is proposed that this connective can be interpreted as a Stalnaker (counter factual) conditional, where the nearness ordering among 'worlds' (in this case, QM pure states) derives in a natural way from the Hilbert space inner-product metric. It is a characteristic of the quantum logic conditional that the law of modus ponens is equivalent to the orthomodular law of conventional quantum logic. (B.R.H.)
Handling Pressures of Community Logic
DEFF Research Database (Denmark)
Minbaeva, Dana; Hotho, Jasper; Muratbekova-Touron, Maral
2013-01-01
The paper aims at investigating how in pluralistic societies, such as emerging economies and countries in transition, organizational decision-makers respond to pressures of community logics in non-community settings, such as the work place. We theorize that in non-community settings, social...... relations and interactions with community members can act as social cues that induce and expose individuals to community logics. We subsequently propose that properties of these relations – immediacy and relatedness - will affect individual response strategies towards community logics. We test these ideas...... with an experimental vignette study of the effects of clan and kinship ties on recruitment and selection decisions in Kazakhstan, followed by qualitative interviews....
Miniaturization of Josephson logic circuits
International Nuclear Information System (INIS)
Ko, H.; Van Duzer, T.
1985-01-01
The performances of Current Injection Logic (CIL) and Resistor Coupled Josephson Logic (RCJL) have been evaluated for minimum features sizes ranging from 5 μm to 0.2 μm. The logic delay is limited to about 10 ps for both the CIL AND gate and the RCJL OR gate biased at 70% of maximum bias current. The maximum circuit count on an 6.35 x 6.35 chip is 13,000 for CIL gates and 20,000 for RCJL gates. Some suggestions are given for further improvements
Nanoelectromechanical resonator for logic operations
Kazmi, Syed N. R.
2017-08-29
We report an electro-thermally tunable in-plane doubly-clamped nanoelectromechanical resonator capable of dynamically performing NOR, NOT, XNOR, XOR, and AND logic operations. Toward this, a silicon based resonator is fabricated using standard e-beam lithography and surface nanomachining of a highly conductive device layer of a silicon-on-insulator (SOI) wafer. The performance of this logic device is examined at elevated temperatures, ranging from 25 °C to 85 °C, demonstrating its resilience for most of the logic operations; thereby paving the way towards nano-elements-based mechanical computing.
Formalized Epistemology, Logic, and Grammar
Bitbol, Michel
The task of a formal epistemology is defined. It appears that a formal epistemology must be a generalization of "logic" in the sense of Wittgenstein's Tractatus. The generalization is required because, whereas logic presupposes a strict relation between activity and language, this relation may be broken in some domains of experimental enquiry (e.g., in microscopic physics). However, a formal epistemology should also retain a major feature of Wittgenstein's "logic": It must not be a discourse about scientific knowledge, but rather a way of making manifest the structures usually implicit in knowledge-gaining activity. This strategy is applied to the formalism of quantum mechanics.
The Interplay of Institutional Logics in IT Public–Private Partnerships
DEFF Research Database (Denmark)
Beck, Roman; Marschollek, Oliver; Gregory, Robert
2015-01-01
- and private-side stakeholders. Our case study of an IT PPP reveals public- and private-side differences that initially impeded the establishment of a partnership; using institutional logics theory as meta-theoretical lens, we propose a model that explains how public and private parties managed to negotiate...... their mode of collaboration by balancing their competing institutional norms and practices which ultimately resulted in the convergence of the two divergent logics. Our paper contributes to theory and practice by (1) elucidating the theoretical foundations and role of institutional logics for IT project...
Szulczyński, Bartosz; Gębicki, Jacek; Namieśnik, Jacek
2018-01-01
The paper presents the possibility of application of fuzzy logic to determine the odour intensity of model, ternary gas mixtures (α-pinene, toluene and triethylamine) using electronic nose prototype. The results obtained using fuzzy logic algorithms were compared with the values obtained using multiple linear regression (MLR) model and sensory analysis. As the results of the studies, it was found the electronic nose prototype along with the fuzzy logic pattern recognition system can be successfully used to estimate the odour intensity of tested gas mixtures. The correctness of the results obtained using fuzzy logic was equal to 68%.
Surface confined assemblies and polymers for sensing and molecular logic
de Ruiter, Graham; Altman, Marc; Motiei, Leila; Lahav, Michal; van der Boom, Milko E.
2013-05-01
Since the development of molecule-based sensors and the introduction of molecules mimicking the behavior of the AND gate in solution by de Silva in 1993, molecular (Boolean) Logic and Computing (MBLC) has become increasingly popular. The molecular approach toward Boolean logic resulted in intriguing proofs of concepts in solution including logic gates, half-adders, multiplexers, and flip-flop logic circuits. Molecular assemblies can perform diverse logic tasks by reconfiguring their inputs. Our recent research activities focus on MBLC with electrochromic polymers and immobilized polypyridyl complexes on solid support. We have designed a series of coordination-based thin films that are formed linearly by stepwise wet-chemical deposition or by self-propagating molecular assembly. The electrochromic properties of these films can be used for (i) detecting various analytes in solution and in the air, (ii) MBLC, (iii) electron-transfer studies, and (iv) interlayers for efficient inverted bulk-heterojunction solar cells. Our concept toward MBLC with functionalized surfaces is applicable to electrochemical and chemical inputs coupled with optical readout. Using this approach, we demonstrated various logic architectures with redox-active functionalized surfaces. Electrochemically operated sequential logic systems (e.g., flip-flops), multi-valued logic, and multi-state memory have been designed, which can improve computational power without increasing spatial requirements. Applying multi-valued digits in data storage and information processing could exponentially increase memory capacity. Our approach is applicable to highly diverse electrochromic thin films that operate at practical voltages (< 1.5 V).
Computational intelligence synergies of fuzzy logic, neural networks and evolutionary computing
Siddique, Nazmul
2013-01-01
Computational Intelligence: Synergies of Fuzzy Logic, Neural Networks and Evolutionary Computing presents an introduction to some of the cutting edge technological paradigms under the umbrella of computational intelligence. Computational intelligence schemes are investigated with the development of a suitable framework for fuzzy logic, neural networks and evolutionary computing, neuro-fuzzy systems, evolutionary-fuzzy systems and evolutionary neural systems. Applications to linear and non-linear systems are discussed with examples. Key features: Covers all the aspect
Linearization of CIF through SOS
Nadales Agut, D.E.; Reniers, M.A.; Luttik, B.; Valencia, F.
2011-01-01
Linearization is the procedure of rewriting a process term into a linear form, which consist only of basic operators of the process language. This procedure is interesting both from a theoretical and a practical point of view. In particular, a linearization algorithm is needed for the Compositional
Quantum supports and modal logic
International Nuclear Information System (INIS)
Svetlichny, G.
1986-01-01
Recently Foulis, Piron, and Randall introduced a new interpretation of empirical and quantum logics which substitute for the notion of a probabilistic weight a combinatorial notion called a support. The informal use of the notion of ''possible outcomes of experiments'' suggests that this interpretation can be related to corresponding formal notions as treated by modal logic. The purpose of this paper is to prove that in fact supports are in one-to-one correspondence with the sets of possibly true elementary propositions in Kripke models of a set of modal formulas associated to the empirical or quantum logic. This hopefully provides a sufficiently detailed link between the two rather distinct logical systems to shed useful light on both
Classical Limit and Quantum Logic
Losada, Marcelo; Fortin, Sebastian; Holik, Federico
2018-02-01
The analysis of the classical limit of quantum mechanics usually focuses on the state of the system. The general idea is to explain the disappearance of the interference terms of quantum states appealing to the decoherence process induced by the environment. However, in these approaches it is not explained how the structure of quantum properties becomes classical. In this paper, we consider the classical limit from a different perspective. We consider the set of properties of a quantum system and we study the quantum-to-classical transition of its logical structure. The aim is to open the door to a new study based on dynamical logics, that is, logics that change over time. In particular, we appeal to the notion of hybrid logics to describe semiclassical systems. Moreover, we consider systems with many characteristic decoherence times, whose sublattices of properties become distributive at different times.
Logical Theories for Agent Introspection
DEFF Research Database (Denmark)
Bolander, Thomas
2004-01-01
Artificial intelligence systems (agents) generally have models of the environments they inhabit which they use for representing facts, for reasoning about these facts and for planning actions. Much intelligent behaviour seems to involve an ability to model not only one's external environment...... by self-reference. In the standard approach taken in artificial intelligence, the model that an agent has of its environment is represented as a set of beliefs. These beliefs are expressed as logical formulas within a formal, logical theory. When the logical theory is expressive enough to allow...... introspective reasoning, the presence of self-reference causes the theory to be prone to inconsistency. The challenge therefore becomes to construct logical theories supporting introspective reasoning while at the same time ensuring that consistency is retained. In the thesis, we meet this challenge by devising...
Dependence logic theory and applications
Kontinen, Juha; Väänänen, Jouko; Vollmer, Heribert
2016-01-01
In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning ...
Nanoelectromechanical resonator for logic operations
Kazmi, Syed N. R.; Hafiz, Md A. Al; Chappanda, Karumbaiah N.; Ilyas, Saad; Holguin, Jorge; Da Costa, Pedro M. F. J.; Younis, Mohammad I.
2017-01-01
We report an electro-thermally tunable in-plane doubly-clamped nanoelectromechanical resonator capable of dynamically performing NOR, NOT, XNOR, XOR, and AND logic operations. Toward this, a silicon based resonator is fabricated using standard e
Empirical logic and quantum mechanics
International Nuclear Information System (INIS)
Foulis, D.J.; Randall, C.H.
1976-01-01
This article discusses some of the basic notions of quantum physics within the more general framework of operational statistics and empirical logic (as developed in Foulis and Randall, 1972, and Randall and Foulis, 1973). Empirical logic is a formal mathematical system in which the notion of an operation is primitive and undefined; all other concepts are rigorously defined in terms of such operations (which are presumed to correspond to actual physical procedures). (Auth.)
Logical operations using phenyl ring
Patra, Moumita; Maiti, Santanu K.
2018-02-01
Exploiting the effects of quantum interference we put forward an idea of designing three primary logic gates, OR, AND and NOT, using a benzene molecule. Under a specific molecule-lead interface geometry, anti-resonant states appear which play the crucial role for AND and NOT operations, while for OR gate no such states are required. Our analysis leads to a possibility of designing logic gates using simple molecular structure which might be significant in the area of molecular electronics.
Observation Predicates in Flow Logic
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis; Sun, Hongyan
2003-01-01
in such a way that the hard constraints are satisfi ed exactly when the observation predicates report no violations. The development is carried out in a large fragment of a first order logic with negation and also takes care of the transformations necessary in order to adhere to the stratification restrictions...... inherent in Alternation-free Least Fixed Point Logic and similar formalisms such as Datalog....
Logically automorphically equivalent knowledge bases
Aladova, Elena; Plotkin, Tatjana
2017-01-01
Knowledge bases theory provide an important example of the field where applications of universal algebra and algebraic logic look very natural, and their interaction with practical problems arising in computer science might be very productive. In this paper we study the equivalence problem for knowledge bases. Our interest is to find out how the informational equivalence is related to the logical description of knowledge. Studying various equivalences of knowledge bases allows us to compare d...
Brünnler, Kai; Flumini, Dandolo; Studer, Thomas
2017-01-01
Blockchains are distributed data structures that are used to achieve consensus in systems for cryptocurrencies (like Bitcoin) or smart contracts (like Ethereum). Although blockchains gained a lot of popularity recently, there is no logic-based model for blockchains available. We introduce BCL, a dynamic logic to reason about blockchain updates, and show that BCL is sound and complete with respect to a simple blockchain model.
Logical Reasoning and Decision Making
Ong, D; Khaddaj, Souheil; Bashroush, Rabih
2011-01-01
Most intelligent systems have some form of \\ud decision making mechanisms built into their \\ud organisations. These normally include a logical \\ud reasoning element into their design. This paper reviews \\ud and compares the different logical reasoning strategies, \\ud and tries to address the accuracy and precision of \\ud decision making by formulating a tolerance to \\ud imprecision view which can be used in conjunction with \\ud the various reasoning strategies.
Flow Logics and Operational Semantics
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1998-01-01
Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analys...... correct. Our main conclusion is that environment based semantics is more flexible than either substitution based semantics or semantics making use of structural congruences (like alpha-renaming)....
Some results from the combinatorial approach to quantum logic
International Nuclear Information System (INIS)
Greechie, R.J.
1976-01-01
The combinatorial approach to quantum logic focuses on certain interconnections between graphs, combinatorial designs, and convex sets as applied to a quantum logic. This article is concerned only with orthomodular lattices and associated structures. A class of complete atomic irreducible semimodular orthomodular lattices is derived which may not be represented as linear subspaces of a vector space over a division ring. Each of these lattices is a proposition system of dimension three. These proposition systems form orthocomplemented non-Desarguesian projective geometries. (B.R.H.)
A logic for specifying stochastic actions and observations
CSIR Research Space (South Africa)
Rens, G
2014-03-01
Full Text Available (2007) 30. Smallwood, R., Sondik, E.: The optimal control of partially observable Markov processes over a finite horizon. Operations Research 21, 1071–1088 (1973) 31. Tarski, A.: A decision method for elementary algebra and geometry. Tech. rep., The RAND... POMDPs totally into the logical arena. One is then in very familiar territory and new opportunities for the advancement in reasoning about POMDPs may be opened up. Systems of linear inequalities are at the heart of Nilsson’s probabilistic logic [19...
Abstract Interpretation of PIC programs through Logic Programming
DEFF Research Database (Denmark)
Henriksen, Kim Steen; Gallagher, John Patrick
2006-01-01
, are applied to the logic based model of the machine. A small PIC microcontroller is used as a case study. An emulator for this microcontroller is written in Prolog, and standard programming transformations and analysis techniques are used to specialise this emulator with respect to a given PIC program....... The specialised emulator can now be further analysed to gain insight into the given program for the PIC microcontroller. The method describes a general framework for applying abstractions, illustrated here by linear constraints and convex hull analysis, to logic programs. Using these techniques on the specialised...
Circuit Simulation of All-Spin Logic
Alawein, Meshal
2016-05-01
With the aggressive scaling of complementary metal-oxide semiconductor (CMOS) nearing an inevitable physical limit and its well-known power crisis, the quest for an alternative/augmenting technology that surpasses the current semiconductor electronics is needed for further technological progress. Spintronic devices emerge as prime candidates for Beyond CMOS era by utilizing the electron spin as an extra degree of freedom to decrease the power consumption and overcome the velocity limit connected with the charge. By using the nonvolatility nature of magnetization along with its direction to represent a bit of information and then manipulating it by spin-polarized currents, routes are opened for combined memory and logic. This would not have been possible without the recent discoveries in the physics of nanomagnetism such as spin-transfer torque (STT) whereby a spin-polarized current can excite magnetization dynamics through the transfer of spin angular momentum. STT have expanded the available means of switching the magnetization of magnetic layers beyond old classical techniques, promising to fulfill the need for a new generation of dense, fast, and nonvolatile logic and storage devices. All-spin logic (ASL) is among the most promising spintronic logic switches due to its low power consumption, logic-in-memory structure, and operation on pure spin currents. The device is based on a lateral nonlocal spin valve and STT switching. It utilizes two nanomagnets (whereby information is stored) that communicate with pure spin currents through a spin-coherent nonmagnetic channel. By using the well-known spin physics and the recently proposed four-component spin circuit formalism, ASL can be thoroughly studied and simulated. Previous attempts to model ASL in the linear and diffusive regime either neglect the dynamic characteristics of transport or do not provide a scalable and robust platform for full micromagnetic simulations and inclusion of other effects like spin Hall
Shilov, Georgi E
1977-01-01
Covers determinants, linear spaces, systems of linear equations, linear functions of a vector argument, coordinate transformations, the canonical form of the matrix of a linear operator, bilinear and quadratic forms, Euclidean spaces, unitary spaces, quadratic forms in Euclidean and unitary spaces, finite-dimensional space. Problems with hints and answers.
Optically controllable molecular logic circuits
International Nuclear Information System (INIS)
Nishimura, Takahiro; Fujii, Ryo; Ogura, Yusuke; Tanida, Jun
2015-01-01
Molecular logic circuits represent a promising technology for observation and manipulation of biological systems at the molecular level. However, the implementation of molecular logic circuits for temporal and programmable operation remains challenging. In this paper, we demonstrate an optically controllable logic circuit that uses fluorescence resonance energy transfer (FRET) for signaling. The FRET-based signaling process is modulated by both molecular and optical inputs. Based on the distance dependence of FRET, the FRET pathways required to execute molecular logic operations are formed on a DNA nanostructure as a circuit based on its molecular inputs. In addition, the FRET pathways on the DNA nanostructure are controlled optically, using photoswitching fluorescent molecules to instruct the execution of the desired operation and the related timings. The behavior of the circuit can thus be controlled using external optical signals. As an example, a molecular logic circuit capable of executing two different logic operations was studied. The circuit contains functional DNAs and a DNA scaffold to construct two FRET routes for executing Input 1 AND Input 2 and Input 1 AND NOT Input 3 operations on molecular inputs. The circuit produced the correct outputs with all possible combinations of the inputs by following the light signals. Moreover, the operation execution timings were controlled based on light irradiation and the circuit responded to time-dependent inputs. The experimental results demonstrate that the circuit changes the output for the required operations following the input of temporal light signals
A Comparison of Implications in Orthomodular Quantum Logic—Morphological Analysis of Quantum Logic
Directory of Open Access Journals (Sweden)
Mitsuhiko Fujio
2012-01-01
Full Text Available Morphological operators are generalized to lattices as adjunction pairs (Serra, 1984; Ronse, 1990; Heijmans and Ronse, 1990; Heijmans, 1994. In particular, morphology for set lattices is applied to analyze logics through Kripke semantics (Bloch, 2002; Fujio and Bloch, 2004; Fujio, 2006. For example, a pair of morphological operators as an adjunction gives rise to a temporalization of normal modal logic (Fujio and Bloch, 2004; Fujio, 2006. Also, constructions of models for intuitionistic logic or linear logics can be described in terms of morphological interior and/or closure operators (Fujio and Bloch, 2004. This shows that morphological analysis can be applied to various non-classical logics. On the other hand, quantum logics are algebraically formalized as orhomodular or modular ortho-complemented lattices (Birkhoff and von Neumann, 1936; Maeda, 1980; Chiara and Giuntini, 2002, and shown to allow Kripke semantics (Chiara and Giuntini, 2002. This suggests the possibility of morphological analysis for quantum logics. In this article, to show an efficiency of morphological analysis for quantum logic, we consider the implication problem in quantum logics (Chiara and Giuntini, 2002. We will give a comparison of the 5 polynomial implication connectives available in quantum logics.
French-speaking meeting on fuzzy logic and its applications
International Nuclear Information System (INIS)
1997-01-01
The 1997 edition of LFA'97 meeting for fuzzy logic has been organized by the Pattern Recognition and Computer Vision Laboratory of the National Institute of Applied Sciences. The objective of the meeting was to provide a forum for researchers and users of fuzzy logic and possibility theory to present and discuss theoretical researches and concrete applications. The domains in concern are: the control decision theory, the pattern recognition and image analysis, the artificial intelligence and the information systems. From the 41 papers of this book, two were selected for ETDE and deal with fuzzy regulation systems for heating systems and with fuzzy controllers for gas refining plants, and one was selected for INIS and deal with real-time surveillance and fuzzy logic control systems for nuclear power plants. (J.S.)
Fuzzy logic an introductory course for engineering students
Trillas, Enric
2015-01-01
This book introduces readers to fundamental concepts in fuzzy logic. It describes the necessary theoretical background and a number of basic mathematical models. Moreover, it makes them familiar with fuzzy control, an important topic in the engineering field. The book offers an unconventional introductory textbook on fuzzy logic, presenting theory together with examples and not always following the typical mathematical style of theorem-corollaries. Primarily intended to support engineers during their university studies, and to spark their curiosity about fuzzy logic and its applications, the book is also suitable for self-study, providing a valuable resource for engineers and professionals who deal with imprecision and non-random uncertainty in real-world applications.
Fifty years of fuzzy logic and its applications
Rishe, Naphtali; Kandel, Abraham
2015-01-01
This book presents a comprehensive report on the evolution of Fuzzy Logic since its formulation in Lotfi Zadeh’s seminal paper on “fuzzy sets,” published in 1965. In addition, it features a stimulating sampling from the broad field of research and development inspired by Zadeh’s paper. The chapters, written by pioneers and prominent scholars in the field, show how fuzzy sets have been successfully applied to artificial intelligence, control theory, inference, and reasoning. The book also reports on theoretical issues; features recent applications of Fuzzy Logic in the fields of neural networks, clustering, data mining, and software testing; and highlights an important paradigm shift caused by Fuzzy Logic in the area of uncertainty management. Conceived by the editors as an academic celebration of the fifty years’ anniversary of the 1965 paper, this work is a must-have for students and researchers willing to get an inspiring picture of the potentialities, limitations, achievements and accomplishments...
Interdisciplinary arts and health practice with an institutional logics perspective
DEFF Research Database (Denmark)
Jensen, Anita
2018-01-01
Background:Investigating the interdisciplinary relationships between stakeholders engaged in arts and health practice in the UK and Denmark, specifically with regard to institutional logics theory. The identified stakeholders: health professionals, museum educators and mental health service users....... Method:Semi-structured interviews were conducted with 30 participants: health professionals, museum educators and service users. Data were collected in Denmark and the UK. A thematic approach was used to analyse the data and theoretical lenses of sociological theories, and institutional logics explored...... the findings. Results:The interdisciplinary work in arts and health is complex, given the different disciplines and institutions involved. Findings illustrate that institutional logics play a vital and ambiguous part in arts and health practice and that this presents a challenge for interdisciplinary working...
On Structural Completeness of Tabular Superintuitionistic Logics
Citkin, Alexander
2015-01-01
As usual, the superintuitionistic (propositional) logics (that is, logics extending intuitionistic logic) are being studied “modulo derivability”, meaning such logics are viewed extensionally — they are identified with the set of formulae that are valid (derivable in the corresponding calculus) in
Temporal logics and real time expert systems
Blom, J.A.
1996-01-01
This paper introduces temporal logics. Due to the eternal compromise between expressive adequacy and reasoning efficiency that must decided upon in any application, full (first order logic or modal logic based) temporal logics are frequently not suitable. This is especially true in real time expert
Breaking the fault tree circular logic
International Nuclear Information System (INIS)
Lankin, M.
2000-01-01
Event tree - fault tree approach to model failures of nuclear plants as well as of other complex facilities is noticeably dominant now. This approach implies modeling an object in form of unidirectional logical graph - tree, i.e. graph without circular logic. However, genuine nuclear plants intrinsically demonstrate quite a few logical loops (circular logic), especially where electrical systems are involved. This paper shows the incorrectness of existing practice of circular logic breaking by elimination of part of logical dependencies and puts forward a formal algorithm, which enables the analyst to correctly model the failure of complex object, which involves logical dependencies between system and components, in form of fault tree. (author)
Transfer of optical signals around bends in two-dimensional linear photonic networks
International Nuclear Information System (INIS)
Nikolopoulos, G M
2015-01-01
The ability to navigate light signals in two-dimensional networks of waveguide arrays is a prerequisite for the development of all-optical integrated circuits for information processing and networking. In this article, we present a theoretical analysis of bending losses in linear photonic lattices with engineered couplings, and discuss possible ways for their minimization. In contrast to previous work in the field, the lattices under consideration operate in the linear regime, in the sense that discrete solitons cannot exist. The present results suggest that the functionality of linear waveguide networks can be extended to operations that go beyond the recently demonstrated point-to-point transfer of signals, such as blocking, routing, logic functions, etc. (paper)
Proposal for the Formalization of Dialectical Logic
Directory of Open Access Journals (Sweden)
José Luis Usó-Doménech
2016-12-01
Full Text Available Classical logic is typically concerned with abstract analysis. The problem for a synthetic logic is to transcend and unify available data to reconstruct the object as a totality. Three rules are proposed to pass from classic logic to synthetic logic. We present the category logic of qualitative opposition using examples from various sciences. This logic has been defined to include the neuter as part of qualitative opposition. The application of these rules to qualitative opposition, and, in particular, its neuter, demonstrated that a synthetic logic allows the truth of some contradictions. This synthetic logic is dialectical with a multi-valued logic, which gives every proposition a truth value in the interval [0,1] that is the square of the modulus of a complex number. In this dialectical logic, contradictions of the neuter of an opposition may be true.
Type-2 fuzzy logic uncertain systems’ modeling and control
Antão, Rómulo
2017-01-01
This book focuses on a particular domain of Type-2 Fuzzy Logic, related to process modeling and control applications. It deepens readers’understanding of Type-2 Fuzzy Logic with regard to the following three topics: using simpler methods to train a Type-2 Takagi-Sugeno Fuzzy Model; using the principles of Type-2 Fuzzy Logic to reduce the influence of modeling uncertainties on a locally linear n-step ahead predictor; and developing model-based control algorithms according to the Generalized Predictive Control principles using Type-2 Fuzzy Sets. Throughout the book, theory is always complemented with practical applications and readers are invited to take their learning process one step farther and implement their own applications using the algorithms’ source codes (provided). As such, the book offers avaluable referenceguide for allengineers and researchers in the field ofcomputer science who are interested in intelligent systems, rule-based systems and modeling uncertainty.
Axially modulated arch resonator for logic and memory applications
Hafiz, Md Abdullah Al
2018-01-17
We demonstrate reconfigurable logic and random access memory devices based on an axially modulated clamped-guided arch resonator. The device is electrostatically actuated and the motional signal is capacitively sensed, while the resonance frequency is modulated through an axial electrostatic force from the guided side of the microbeam. A multi-physics finite element model is used to verify the effectiveness of the axial modulation. We present two case studies: first, a reconfigurable two-input logic gate based on the linear resonance frequency modulation, and second, a memory element based on the hysteretic frequency response of the resonator working in the nonlinear regime. The energy consumptions of the device for both logic and memory operations are in the range of picojoules, promising for energy efficient alternative computing paradigm.
A Resolution Prover for Coalition Logic
Nalon, Cláudia; Zhang, Lan; Dixon, Clare; Hustadt, Ullrich
2014-01-01
We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolution-based calculus for Coalition Logic. We then give details of the implementation of CLProver and prese...
A vindication of logical necessity against scepticism
Philie, Patrice
2002-01-01
Some philosophers dispute the claim that there is a notion of logical necessity involved in the concept of logical consequence. They are sceptical about logical necessity. They argue that a proper characterisation of logical consequence - of what follows from what - need not and should not appeal to the notion of necessity at all. Quine is the most prominent philosopher holding such a view. In this doctoral dissertation, I argue that scepticism about logical necessity is not successful. Quine...
Logical obstacles in learning planetary motion
Dileep, V.; Sathe, D. V.
Daniel Schaffer wrote now-a-days scientists and particularly theoretical physicists are not held in unquestioned esteem in his editorial This became the starting point of my presentation which was dedicated to the memory of Abdus Salam 1 Had he survived to witness the IYP he would have become surprised on knowing that Frank Wilczek had maximum trouble in learning classical mechanics 2 These facts require us to restudy learning O level physics from the logical point of view - in order to attract promising young students to take up challenges of physics and astronomy of the 21 st century Newton s laws of motion are known for more than 300 years and so there should not be any problems in learning and teaching these laws now in the 21 st century But findings of educators reported in the last 30 years show that there are some serious and global problems I have shown that there are some logical obstacles which make adverse effect on the comprehension of circular motion and related topics 3 In this presentation relevant aspects are discussed References begin enumerate item D V Sathe August 2001 Chemical Education International http www iupac org publications cei vol2 0201x0026 html item Frank Wilczek October 2004 Physics Today p 11 item D V Sathe December 2001 COSPAR Info Bulletin 152 p 53 end enumerate
A new hierarchy of infinitary logics in abstract algebraic logic
Czech Academy of Sciences Publication Activity Database
Lávička, Tomáš; Noguera, Carles
2017-01-01
Roč. 105, č. 3 (2017), s. 521-551 ISSN 0039-3215 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985556 ; RVO:67985807 Keywords : Abstract algebraic logic * consequence relations * infinitary logics * completeness properties Subject RIV: BA - General Mathematics; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics; Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) (UIVT-O) Impact factor: 0.589, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/noguera-0469118.pdf
Strategies and logics of internationalization
Directory of Open Access Journals (Sweden)
Mahjouba Ben Salem
2013-07-01
Full Text Available The race between firms to acquire capacities worldwide has evolved in a chronological order which centered at first around products, then around position to move later on to skills and to focus currently on networks. Similarly, when observing the evolution of the different international development strategies, it was found out that they have started by the exportation and the setting up of production subsidiaries to move more recently to such strategies as mergers & acquisitions and international alliances. The present paper investigates the relationship between the internationalization strategies and logics and comes to the conclusion that, a particular logic is behind every choice made. Indeed, the present work was conducted within the Tunisian food enterprises and helped confirm this hypothesis as it was found out that the position logic is behind the choice of exportation and the creation of production subsidiaries while the choice of partnership is based on the logic of skills. The option for merger, on the other hand, is motivated by the networks logic.
Feferman on foundations logic, mathematics, philosophy
Sieg, Wilfried
2017-01-01
This volume honours the life and work of Solomon Feferman, one of the most prominent mathematical logicians of the latter half of the 20th century. In the collection of essays presented here, researchers examine Feferman’s work on mathematical as well as specific methodological and philosophical issues that tie into mathematics. Feferman’s work was largely based in mathematical logic (namely model theory, set theory, proof theory and computability theory), but also branched out into methodological and philosophical issues, making it well known beyond the borders of the mathematics community. With regard to methodological issues, Feferman supported concrete projects. On the one hand, these projects calibrate the proof theoretic strength of subsystems of analysis and set theory and provide ways of overcoming the limitations imposed by Gödel’s incompleteness theorems through appropriate conceptual expansions. On the other, they seek to identify novel axiomatic foundations for mathematical practice, truth ...
Biological formal counterparts of logical machines
Energy Technology Data Exchange (ETDEWEB)
Moreno-diaz, R; Hernandez Guarch, F
1983-01-01
The significance of the McCulloch-Pitts formal neural net theory (1943) is still nowadays frequently misunderstood, and their basic units are wrongly considered as factual models for neurons. As a consequence, the whole original theory and its later addenda are unreasonably criticized for their simplicity. But, as it was proved then and since, the theory is after the modular neurophysiological counterpart of logical machines, so that it actually provides biologically plausible models for automata, turing machines, etc., and not vice versa. In its true context, no theory has surpassed its proposals. In McCulloch and Pitts memoriam and for the sake of future theoretical research, the authors stress this important historical point, including also some recent results on the neurophysiological counterparts of modular arbitrary probabilistic automata. 16 references.
A fuzzy logic pitch angle controller for power system stabilization
Energy Technology Data Exchange (ETDEWEB)
Jauch, Clemens; Cronin, Tom; Sorensen, Poul [Wind Energy Department, Riso National Laboratory, PO Box 49, DK-4000 Roskilde, (Denmark); Jensen, Birgitte Bak [Institute of Energy Technology, Aalborg University, Pontoppidanstraede 101, DK-9220 Aalborg East, (Denmark)
2006-07-12
In this article the design of a fuzzy logic pitch angle controller for a fixed speed, active-stall wind turbine, which is used for power system stabilization, is presented. The system to be controlled, which is the wind turbine and the power system to which the turbine is connected, is described. The advantages of fuzzy logic control when applied to large-signal control of active-stall wind turbines are outlined. The general steps of the design process for a fuzzy logic controller, including definition of the controller inputs, set-up of the fuzzy rules and the method of defuzzification, are described. The performance of the controller is assessed by simulation, where the wind turbine's task is to dampen power system oscillations. In the scenario simulated for this work, the wind turbine has to ride through a transient short-circuit fault and subsequently contribute to the damping of the grid frequency oscillations that are caused by the transient fault. It is concluded that the fuzzy logic controller enables the wind turbine to dampen power system oscillations. It is also concluded that, owing to the inherent non-linearities in a wind turbine and the unpredictability of the whole system, the fuzzy logic controller is very suitable for this application. (Author).
Autonomous vehicle motion control, approximate maps, and fuzzy logic
Ruspini, Enrique H.
1993-01-01
Progress on research on the control of actions of autonomous mobile agents using fuzzy logic is presented. The innovations described encompass theoretical and applied developments. At the theoretical level, results of research leading to the combined utilization of conventional artificial planning techniques with fuzzy logic approaches for the control of local motion and perception actions are presented. Also formulations of dynamic programming approaches to optimal control in the context of the analysis of approximate models of the real world are examined. Also a new approach to goal conflict resolution that does not require specification of numerical values representing relative goal importance is reviewed. Applied developments include the introduction of the notion of approximate map. A fuzzy relational database structure for the representation of vague and imprecise information about the robot's environment is proposed. Also the central notions of control point and control structure are discussed.
Lu, Jiao Yang; Zhang, Xin Xing; Huang, Wei Tao; Zhu, Qiu Yan; Ding, Xue Zhi; Xia, Li Qiu; Luo, Hong Qun; Li, Nian Bing
2017-09-19
The most serious and yet unsolved problems of molecular logic computing consist in how to connect molecular events in complex systems into a usable device with specific functions and how to selectively control branchy logic processes from the cascading logic systems. This report demonstrates that a Boolean logic tree is utilized to organize and connect "plug and play" chemical events DNA, nanomaterials, organic dye, biomolecule, and denaturant for developing the dual-signal electrochemical evolution aptasensor system with good resettability for amplification detection of thrombin, controllable and selectable three-state logic computation, and keypad lock security operation. The aptasensor system combines the merits of DNA-functionalized nanoamplification architecture and simple dual-signal electroactive dye brilliant cresyl blue for sensitive and selective detection of thrombin with a wide linear response range of 0.02-100 nM and a detection limit of 1.92 pM. By using these aforementioned chemical events as inputs and the differential pulse voltammetry current changes at different voltages as dual outputs, a resettable three-input biomolecular keypad lock based on sequential logic is established. Moreover, the first example of controllable and selectable three-state molecular logic computation with active-high and active-low logic functions can be implemented and allows the output ports to assume a high impediment or nothing (Z) state in addition to the 0 and 1 logic levels, effectively controlling subsequent branchy logic computation processes. Our approach is helpful in developing the advanced controllable and selectable logic computing and sensing system in large-scale integration circuits for application in biomedical engineering, intelligent sensing, and control.
Logical foundation of quantum mechanics
International Nuclear Information System (INIS)
Stachow, E.W.
1980-01-01
The subject of this article is the reconstruction of quantum mechanics on the basis of a formal language of quantum mechanical propositions. During recent years, research in the foundations of the language of science has given rise to a dialogic semantics that is adequate in the case of a formal language for quantum physics. The system of sequential logic which is comprised by the language is more general than classical logic; it includes the classical system as a special case. Although the system of sequential logic can be founded without reference to the empirical content of quantum physical propositions, it establishes an essential part of the structure of the mathematical formalism used in quantum mechanics. It is the purpose of this paper to demonstrate the connection between the formal language of quantum physics and its representation by mathematical structures in a self-contained way. (author)
Coinductive Logic Programming with Negation
Min, Richard; Gupta, Gopal
We introduce negation into coinductive logic programming (co-LP) via what we term Coinductive SLDNF (co-SLDNF) resolution. We present declarative and operational semantics of co-SLDNF resolution and present their equivalence under the restriction of rationality. Co-LP with co-SLDNF resolution provides a powerful, practical and efficient operational semantics for Fitting's Kripke-Kleene three-valued logic with restriction of rationality. Further, applications of co-SLDNF resolution are also discussed and illustrated where Co-SLDNF resolution allows one to develop elegant implementations of modal logics. Moreover it provides the capability of non-monotonic inference (e.g., predicate Answer Set Programming) that can be used to develop novel and effective first-order modal non-monotonic inference engines.
Logic, probability, and human reasoning.
Johnson-Laird, P N; Khemlani, Sangeet S; Goodwin, Geoffrey P
2015-04-01
This review addresses the long-standing puzzle of how logic and probability fit together in human reasoning. Many cognitive scientists argue that conventional logic cannot underlie deductions, because it never requires valid conclusions to be withdrawn - not even if they are false; it treats conditional assertions implausibly; and it yields many vapid, although valid, conclusions. A new paradigm of probability logic allows conclusions to be withdrawn and treats conditionals more plausibly, although it does not address the problem of vapidity. The theory of mental models solves all of these problems. It explains how people reason about probabilities and postulates that the machinery for reasoning is itself probabilistic. Recent investigations accordingly suggest a way to integrate probability and deduction. Copyright © 2015 Elsevier Ltd. All rights reserved.
Linear programming using Matlab
Ploskas, Nikolaos
2017-01-01
This book offers a theoretical and computational presentation of a variety of linear programming algorithms and methods with an emphasis on the revised simplex method and its components. A theoretical background and mathematical formulation is included for each algorithm as well as comprehensive numerical examples and corresponding MATLAB® code. The MATLAB® implementations presented in this book are sophisticated and allow users to find solutions to large-scale benchmark linear programs. Each algorithm is followed by a computational study on benchmark problems that analyze the computational behavior of the presented algorithms. As a solid companion to existing algorithmic-specific literature, this book will be useful to researchers, scientists, mathematical programmers, and students with a basic knowledge of linear algebra and calculus. The clear presentation enables the reader to understand and utilize all components of simplex-type methods, such as presolve techniques, scaling techniques, pivoting ru...
3. Theoretical Physics Division
International Nuclear Information System (INIS)
For the period September 1980 - Aug 1981, the studies in theoretical physics divisions have been compiled under the following headings: in nuclear physics, nuclear structure, nuclear reactions and intermediate energies; in particle physics, NN and NantiN interactions, dual topological unitarization, quark model and quantum chromodynamics, classical and quantum field theories, non linear integrable equations and topological preons and Grand unified theories. A list of publications, lectures and meetings is included [fr
On-line tuning of a fuzzy-logic power system stabilizer
International Nuclear Information System (INIS)
Hossein-Zadeh, N.; Kalam, A.
2002-01-01
A scheme for on-line tuning of a fuzzy-logic power system stabilizer is presented. firstly, a fuzzy-logic power system stabilizer is developed using speed deviation and accelerating power as the controller input variables. The inference mechanism of fuzzy-logic controller is represented by a decision table, constructed of linguistic IF-THEN rules. The Linguistic rules are available from experts and the design procedure is based on these rules. It assumed that an exact model of the plant is not available and it is difficult to extract the exact parameters of the power plant. Thus, the design procedure can not be based on an exact model. This is an advantage of fuzzy logic that makes the design of a controller possible without knowing the exact model of the plant. Secondly, two scaling parameters are introduced to tune the fuzzy-logic power system stabilizer. These scaling parameters are the outputs of another fuzzy-logic system, which gets the operating conditions of power system as inputs. These mechanism of tuning the fuzzy-logic power system stabilizer makes the fuzzy-logic power system stabilizer adaptive to changes in the operating conditions. Therefore, the degradation of the system response, under a wide range of operating conditions, is less compared to the system response with a fixed-parameter fuzzy-logic power system stabilizer and a conventional (linear) power system stabilizer. The tuned stabilizer has been tested by performing nonlinear simulations using a synchronous machine-infinite bus model. The responses are compared with a fixed parameters fuzzy-logic power system stabilizer and a conventional (linear) power system stabilizer. It is shown that the tuned fuzzy-logic power system stabilizer is superior to both of them
Negative Campaigning and the Logic of Retaliation in Multiparty Competition
Dolezal, Martin; Ennser-Jedenastik, Laurenz; M?ller, Wolfgang C.
2016-01-01
The extant literature has demonstrated that the logic of retaliation is a core feature of negative campaigning. Attacks by one side induce counterattacks by the other. Yet most research on the interactive nature of negative campaigning is limited to two-party competition and provides little theoretical justification for why political actors should respond to attacks with counterattacks. The present paper addresses these research gaps. We argue that the negativity bias in human information pro...
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy students...... have a tendency correctly to assess valid syllogisms as such more often than correctly assessing invalid syllogisms as such. It is also investigated to what extent the students have improved their skills in practical reasoning by attending the logic courses. Finally, some open questions regarding...
The logical foundations of mathematics
Hatcher, William S
1981-01-01
The Logical Foundations of Mathematics offers a study of the foundations of mathematics, stressing comparisons between and critical analyses of the major non-constructive foundational systems. The position of constructivism within the spectrum of foundational philosophies is discussed, along with the exact relationship between topos theory and set theory.Comprised of eight chapters, this book begins with an introduction to first-order logic. In particular, two complete systems of axioms and rules for the first-order predicate calculus are given, one for efficiency in proving metatheorems, and
Symmetric normalisation for intuitionistic logic
DEFF Research Database (Denmark)
Guenot, Nicolas; Straßburger, Lutz
2014-01-01
We present two proof systems for implication-only intuitionistic logic in the calculus of structures. The first is a direct adaptation of the standard sequent calculus to the deep inference setting, and we describe a procedure for cut elimination, similar to the one from the sequent calculus......, but using a non-local rewriting. The second system is the symmetric completion of the first, as normally given in deep inference for logics with a DeMorgan duality: all inference rules have duals, as cut is dual to the identity axiom. We prove a generalisation of cut elimination, that we call symmetric...
Sequential logic analysis and synthesis
Cavanagh, Joseph
2007-01-01
Until now, there was no single resource for actual digital system design. Using both basic and advanced concepts, Sequential Logic: Analysis and Synthesis offers a thorough exposition of the analysis and synthesis of both synchronous and asynchronous sequential machines. With 25 years of experience in designing computing equipment, the author stresses the practical design of state machines. He clearly delineates each step of the structured and rigorous design principles that can be applied to practical applications. The book begins by reviewing the analysis of combinatorial logic and Boolean a
An exercise in 'anhomomorphic logic'
International Nuclear Information System (INIS)
Sorkin, Rafael D
2007-01-01
A classical logic exhibits a threefold inner structure comprising an algebra of propositions U, a space of 'truth values' V, and a distinguished family of mappings φ from propositions to truth values. Classically U is a Boolean algebra, V = Z 2 , and the admissible maps φ: U Z 2 are homomorphisms. If one admits a larger set of maps, one obtains an anhomomorphic logic that seems better suited to quantal reality (and the needs of quantum gravity). I explain these ideas and illustrate them with three simple examples
Logic programming and metadata specifications
Lopez, Antonio M., Jr.; Saacks, Marguerite E.
1992-01-01
Artificial intelligence (AI) ideas and techniques are critical to the development of intelligent information systems that will be used to collect, manipulate, and retrieve the vast amounts of space data produced by 'Missions to Planet Earth.' Natural language processing, inference, and expert systems are at the core of this space application of AI. This paper presents logic programming as an AI tool that can support inference (the ability to draw conclusions from a set of complicated and interrelated facts). It reports on the use of logic programming in the study of metadata specifications for a small problem domain of airborne sensors, and the dataset characteristics and pointers that are needed for data access.
Design and experimentation of BSFQ logic devices
International Nuclear Information System (INIS)
Hosoki, T.; Kodaka, H.; Kitagawa, M.; Okabe, Y.
1999-01-01
Rapid single flux quantum (RSFQ) logic needs synchronous pulses for each gate, so the clock-wiring problem is more serious when designing larger scale circuits with this logic. So we have proposed a new SFQ logic which follows Boolean algebra perfectly by using set and reset pulses. With this logic, the level information of current input is transmitted with these pulses generated by level-to-pulse converters, and each gate calculates logic using its phase level made by these pulses. Therefore, our logic needs no clock in each gate. We called this logic 'Boolean SFQ (BSFQ) logic'. In this paper, we report design and experimentation for an AND gate with inverting input based on BSFQ logic. The experimental results for OR and XOR gates are also reported. (author)
Logical space and the origins of pluralism in logic
Czech Academy of Sciences Publication Activity Database
Arazim, Pavel
-, č. 2 (2017), s. 7-26 ISSN 0567-8293 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : pluralism * expressivism * logical space * geometry * holism Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology
Theoretical computer science and the natural sciences
Marchal, Bruno
2005-12-01
I present some fundamental theorems in computer science and illustrate their relevance in Biology and Physics. I do not assume prerequisites in mathematics or computer science beyond the set N of natural numbers, functions from N to N, the use of some notational conveniences to describe functions, and at some point, a minimal amount of linear algebra and logic. I start with Cantor's transcendental proof by diagonalization of the non enumerability of the collection of functions from natural numbers to the natural numbers. I explain why this proof is not entirely convincing and show how, by restricting the notion of function in terms of discrete well defined processes, we are led to the non algorithmic enumerability of the computable functions, but also-through Church's thesis-to the algorithmic enumerability of partial computable functions. Such a notion of function constitutes, with respect to our purpose, a crucial generalization of that concept. This will make easy to justify deep and astonishing (counter-intuitive) incompleteness results about computers and similar machines. The modified Cantor diagonalization will provide a theory of concrete self-reference and I illustrate it by pointing toward an elementary theory of self-reproduction-in the Amoeba's way-and cellular self-regeneration-in the flatworm Planaria's way. To make it easier, I introduce a very simple and powerful formal system known as the Schoenfinkel-Curry combinators. I will use the combinators to illustrate in a more concrete way the notion introduced above. The combinators, thanks to their low-level fine grained design, will also make it possible to make a rough but hopefully illuminating description of the main lessons gained by the careful observation of nature, and to describe some new relations, which should exist between computer science, the science of life and the science of inert matter, once some philosophical, if not theological, hypotheses are made in the cognitive sciences. In the
Using logic models in a community-based agricultural injury prevention project.
Helitzer, Deborah; Willging, Cathleen; Hathorn, Gary; Benally, Jeannie
2009-01-01
The National Institute for Occupational Safety and Health has long promoted the logic model as a useful tool in an evaluator's portfolio. Because a logic model supports a systematic approach to designing interventions, it is equally useful for program planners. Undertaken with community stakeholders, a logic model process articulates the underlying foundations of a particular programmatic effort and enhances program design and evaluation. Most often presented as sequenced diagrams or flow charts, logic models demonstrate relationships among the following components: statement of a problem, various causal and mitigating factors related to that problem, available resources to address the problem, theoretical foundations of the selected intervention, intervention goals and planned activities, and anticipated short- and long-term outcomes. This article describes a case example of how a logic model process was used to help community stakeholders on the Navajo Nation conceive, design, implement, and evaluate agricultural injury prevention projects.
Implicational (semilinear) logics III: completeness properties
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Noguera, Carles
2018-01-01
Roč. 57, 3-4 (2018), s. 391-420 ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * protoalgebraic logics * implicational logics * disjunctional logics * semilinear logics * non-classical logics * completeness theorems * rational completeness Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) OBOR OECD: Computer science s, information science , bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.394, year: 2016
International Nuclear Information System (INIS)
Kawashima, Hideo.
1977-01-01
A fast-slow logic system has been made for use in multi-detector experiments in nuclear physics such as particle-gamma and particle-particle coincidence experiments. The system consists of a fast logic system and a slow logic system. The fast logic system has a function of fast coincidences and provides timing signals for the slow logic system. The slow logic system has a function of slow coincidences and a routing control of input analog signals to the ADCs. (auth.)
Microelectromechanical resonator based digital logic elements
Hafiz, Md Abdullah Al
2016-10-20
Micro/nano-electromechanical resonator based mechanical computing has recently attracted significant attention. However, its full realization has been hindered by the difficulty in realizing complex combinational logics, in which the logic function is constructed by cascading multiple smaller logic blocks. In this work we report an alternative approach for implementation of digital logic core elements, multiplexer and demultiplexer, which can be used to realize combinational logic circuits by suitable concatenation. Toward this, shallow arch shaped microresonators are electrically connected and their resonance frequencies are tuned based on an electrothermal frequency modulation scheme. This study demonstrates that by reconfiguring the same basic building block, the arch microresonator, complex logic circuits can be realized.
Aspects and modular reasoning in nonmonotonic logic
DEFF Research Database (Denmark)
Ostermann, Klaus
2008-01-01
Nonmonotonic logic is a branch of logic that has been developed to model situations with incomplete information. We argue that there is a connection between AOP and nonmonotonic logic which deserves further study. As a concrete technical contribution and "appetizer", we outline an AO semantics de...... defined in default logic (a form of nonmonotonic logic), propose a definition of modular reasoning, and show that the default logic version of the language semantics admits modular reasoning whereas a conventional language semantics based on weaving does not....
Implicational (semilinear) logics III: completeness properties
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Noguera, Carles
2018-01-01
Roč. 57, 3-4 (2018), s. 391-420 ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * protoalgebraic logics * implicational logics * disjunctional logics * semilinear logics * non-classical logics * completeness theorems * rational completeness Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.394, year: 2016
Microelectromechanical resonator based digital logic elements
Hafiz, Md Abdullah Al; Kosuru, Lakshmoji; Younis, Mohammad I.; Fariborzi, Hossein
2016-01-01
Micro/nano-electromechanical resonator based mechanical computing has recently attracted significant attention. However, its full realization has been hindered by the difficulty in realizing complex combinational logics, in which the logic function is constructed by cascading multiple smaller logic blocks. In this work we report an alternative approach for implementation of digital logic core elements, multiplexer and demultiplexer, which can be used to realize combinational logic circuits by suitable concatenation. Toward this, shallow arch shaped microresonators are electrically connected and their resonance frequencies are tuned based on an electrothermal frequency modulation scheme. This study demonstrates that by reconfiguring the same basic building block, the arch microresonator, complex logic circuits can be realized.
HYPROLOG: A New Logic Programming Language with Assumptions and Abduction
DEFF Research Database (Denmark)
Christiansen, Henning; Dahl, Veronica
2005-01-01
We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integrity constraints. Assumptions are a mechanism inspired by linear logic and taken over from Assumption Grammars. The lan......We present HYPROLOG, a novel integration of Prolog with assumptions and abduction which is implemented in and partly borrows syntax from Constraint Handling Rules (CHR) for integrity constraints. Assumptions are a mechanism inspired by linear logic and taken over from Assumption Grammars....... The language shows a novel flexibility in the interaction between the different paradigms, including all additional built-in predicates and constraints solvers that may be available. Assumptions and abduction are especially useful for language processing, and we can show how HYPROLOG works seamlessly together...
International Nuclear Information System (INIS)
Barocas, Marcel
1974-01-01
The objective of this research thesis is to determine, by simulation, the time response of devices based on MOS transistors. After a theoretical study of the MOS element, the author develops a transistor model based on its physical components. This model is firstly used to obtain the transistor static characteristics. The author then studies the time response of the inverter logic circuit which is the basic operator of these circuits. Theoretical results are verified by simulation and by experiments. The author then reports a detailed study of the inverter input impedance, and the decoupling property between logic operators in cascade. The simulation confirms the obtained results. Based on this decoupling property, the output time response of a logic chain is studied by using a simulation software. A general method of determination of the output time response is developed with application to a logic assembly [fr
Ancestor Worship in The Logic of Games. How foundational were Aristotle's contributions?
Directory of Open Access Journals (Sweden)
John Woods
2013-12-01
Full Text Available Notwithstanding their technical virtuosity and growing presence in mainstream thinking, game theoretic logics have attracted a sceptical question: "Granted that logic can be done game theoretically, but what would justify the idea that this is the preferred way to do it?'' A recent suggestion is that at least part of the desired support might be found in the Greek dialectical writings. If so, perhaps we could say that those works possess a kind of foundational significance. The relation of being foundational for is interesting in its own right. In this paper, I explore its ancient applicability to relevant, paraconsistent and nonmonotonic logics, before returning to the question of its ancestral tie, or want of one, to the modern logics of games.
Probabilistic Logic and Probabilistic Networks
Haenni, R.; Romeijn, J.-W.; Wheeler, G.; Williamson, J.
2009-01-01
While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches
Phonotactics in inductive logic programming
Nerbonne, J.; Konstantopoulos, S.; Klopotek, M.A.; Wierzchon, S.T.; Trojanowski, K.
2004-01-01
We examine the results of applying inductive logic programming (ILP) to a relatively simple linguistic task, that of recognizing monosyllables in one language. ILP is suited to linguistic problems given linguists' preference for formulating their theories in discrete rules, and because of ILP's
Logics of communication and change
van Benthem, Johan; van Eijck, Jan; Kooi, Barteld
2006-01-01
Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that
Generic physical protection logic trees
International Nuclear Information System (INIS)
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle
Testing Superconductor Logic Integrated Circuits
Arun, A.J.; Kerkhoff, Hans G.
2005-01-01
Superconductor logic has the potential of extremely low-power consumption and ultra-fast digital signal processing. Unfortunately, the obtained yield of the present processes is low and specific faults occur. This paper deals with fault-modelling, Design-for-Test structures, and ATPG for these
Generic physical protection logic trees
Energy Technology Data Exchange (ETDEWEB)
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle.
Logical Entity Level Sentiment Analysis
DEFF Research Database (Denmark)
Petersen, Niklas Christoffer; Villadsen, Jørgen
2017-01-01
We present a formal logical approach using a combinatory categorial grammar for entity level sentiment analysis that utilizes machine learning techniques for efficient syntactical tagging and performs a deep structural analysis of the syntactical properties of texts in order to yield precise resu...
Topics in computational linear optimization
DEFF Research Database (Denmark)
Hultberg, Tim Helge
2000-01-01
Linear optimization has been an active area of research ever since the pioneering work of G. Dantzig more than 50 years ago. This research has produced a long sequence of practical as well as theoretical improvements of the solution techniques avilable for solving linear optimization problems...... of high quality solvers and the use of algebraic modelling systems to handle the communication between the modeller and the solver. This dissertation features four topics in computational linear optimization: A) automatic reformulation of mixed 0/1 linear programs, B) direct solution of sparse unsymmetric...... systems of linear equations, C) reduction of linear programs and D) integration of algebraic modelling of linear optimization problems in C++. Each of these topics is treated in a separate paper included in this dissertation. The efficiency of solving mixed 0-1 linear programs by linear programming based...
International Nuclear Information System (INIS)
Suwono.
1978-01-01
A linear gate providing a variable gate duration from 0,40μsec to 4μsec was developed. The electronic circuity consists of a linear circuit and an enable circuit. The input signal can be either unipolar or bipolar. If the input signal is bipolar, the negative portion will be filtered. The operation of the linear gate is controlled by the application of a positive enable pulse. (author)
International Nuclear Information System (INIS)
Vretenar, M
2014-01-01
The main features of radio-frequency linear accelerators are introduced, reviewing the different types of accelerating structures and presenting the main characteristics aspects of linac beam dynamics
Energy Technology Data Exchange (ETDEWEB)
Marc Vanderhaeghen
2007-04-01
The theoretical issues in the interpretation of the precision measurements of the nucleon-to-Delta transition by means of electromagnetic probes are highlighted. The results of these measurements are confronted with the state-of-the-art calculations based on chiral effective-field theories (EFT), lattice QCD, large-Nc relations, perturbative QCD, and QCD-inspired models. The link of the nucleon-to-Delta form factors to generalized parton distributions (GPDs) is also discussed.
FUZZY LOGIC IN LEGAL EDUCATION
Directory of Open Access Journals (Sweden)
Z. Gonul BALKIR
2011-04-01
Full Text Available The necessity of examination of every case within its peculiar conditions in social sciences requires different approaches complying with the spirit and nature of social sciences. Multiple realities require different and various perceptual interpretations. In modern world and social sciences, interpretation of perception of valued and multi-valued have been started to be understood by the principles of fuzziness and fuzzy logic. Having the verbally expressible degrees of truthness such as true, very true, rather true, etc. fuzzy logic provides the opportunity for the interpretation of especially complex and rather vague set of information by flexibility or equivalence of the variables’ of fuzzy limitations. The methods and principles of fuzzy logic can be benefited in examination of the methodological problems of law, especially in the applications of filling the legal loopholes arising from the ambiguities and interpretation problems in order to understand the legal rules in a more comprehensible and applicable way and the efficiency of legal implications. On the other hand, fuzzy logic can be used as a technical legal method in legal education and especially in legal case studies and legal practice applications in order to provide the perception of law as a value and the more comprehensive and more quality perception and interpretation of value of justice, which is the core value of law. In the perception of what happened as it has happened in legal relationships and formations, the understanding of social reality and sociological legal rules with multi valued sense perspective and the their applications in accordance with the fuzzy logic’s methods could create more equivalent and just results. It can be useful for the young lawyers and law students as a facilitating legal method especially in the materialization of the perception and interpretation of multi valued and variables. Using methods and principles of fuzzy logic in legal
Probabilistic Rule Generator: A new methodology of variable-valued logic synthesis
International Nuclear Information System (INIS)
Lee, W.D.; Ray, S.R.
1986-01-01
A new methodology to synthesize variable-valued logic formulas from training data events is presented. Probablistic Rule Generator (PRG) employs not only information-theoretic entropy as a heuristic to capture a path expression but also multiple-valued logic to expand a captured complex. PRG is efficient for capturing major clusters in the event space, and is more general than previous methodologies in providing probabilistic features
A new quantum flux parametron logic gate with large input margin
International Nuclear Information System (INIS)
Hioe, W.; Hosoya, M.; Goto, E.
1991-01-01
This paper reports on the Quantum Flux Parametron (QFP) which is a flux transfer, flux activated Josephson logic device which realizes much lower power dissipation than other Josephson logic devices. Being a two-terminal device its correct operation may be affected by coupling to other QFPs. The problems include backcoupling from active QFPs through inactive QFPs (relay noise), coupling between QFPs activated at different times because of clock skew (homophase noise), and interaction between active QFPs (reaction hazard). Previous QFP circuits worked by wired-majority, which being a linear input logic, has low input margin. A new logic gate (D-gate) using a QFP to perform logic operations has been analyzed and tested by computer simulation. Relay noise, homophase noise and reaction hazard are substantially reduced. Moreover, the input have little interaction hence input margin is greatly improved
Logical and mathematical structures of quantum mechanics
International Nuclear Information System (INIS)
Beltrametti, E.G.; Cassinelli, G.
1976-01-01
The logic associated with a physical system is first analysed, and the general properties of observable and states are discussed. The logic of the Hilbert-space formulation of quantum mechanics and of pure, ideal measurements is described
A superposition principle in quantum logics
International Nuclear Information System (INIS)
Pulmannova, S.
1976-01-01
A new definition of the superposition principle in quantum logics is given which enables us to define the sectors. It is shown that the superposition principle holds only in the irreducible quantum logics. (orig.) [de
Logic functions and equations examples and exercises
Steinbach, Bernd
2009-01-01
With a free, downloadable software package available to help solve the exercises, this book focuses on practical and relevant problems that arise in the field of binary logics, with its two main applications - digital circuit design, and propositional logics.
Semantic foundation for preferential description logics
CSIR Research Space (South Africa)
Britz, K
2011-12-01
Full Text Available Description logics are a well-established family of knowledge representation formalisms in Artificial Intelligence. Enriching description logics with non-monotonic reasoning capabilities, especially preferential reasoning as developed by Lehmann...
Towards practical defeasible reasoning for description logics
CSIR Research Space (South Africa)
Casini, G
2013-07-01
Full Text Available The formalisation of defeasible reasoning in automated systems is becoming increasingly important. Description Logics (DLs) are nowadays the main logical formalism in the field of formal ontologies. Our focus in this paper is to devise a practical...
Error-Transparent Quantum Gates for Small Logical Qubit Architectures
Kapit, Eliot
2018-02-01
One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems from a combination of control errors and random single qubit errors from interaction with the environment. While great strides have been made in mitigating control errors, intrinsic qubit error remains a serious problem that limits gate fidelity in modern qubit architectures. Simultaneously, recent developments of small error-corrected logical qubit devices promise significant increases in logical state lifetime, but translating those improvements into increases in gate fidelity is a complex challenge. In this Letter, we construct protocols for gates on and between small logical qubit devices which inherit the parent device's tolerance to single qubit errors which occur at any time before or during the gate. We consider two such devices, a passive implementation of the three-qubit bit flip code, and the author's own [E. Kapit, Phys. Rev. Lett. 116, 150501 (2016), 10.1103/PhysRevLett.116.150501] very small logical qubit (VSLQ) design, and propose error-tolerant gate sets for both. The effective logical gate error rate in these models displays superlinear error reduction with linear increases in single qubit lifetime, proving that passive error correction is capable of increasing gate fidelity. Using a standard phenomenological noise model for superconducting qubits, we demonstrate a realistic, universal one- and two-qubit gate set for the VSLQ, with error rates an order of magnitude lower than those for same-duration operations on single qubits or pairs of qubits. These developments further suggest that incorporating small logical qubits into a measurement based code could substantially improve code performance.
A Logical Characterisation of Static Equivalence
DEFF Research Database (Denmark)
Hüttel, Hans; Pedersen, Michael D.
2007-01-01
-order logic for frames with quantification over environment knowledge which, under certain general conditions, characterizes static equivalence and is amenable to construction of characteristic formulae. The logic can be used to reason about environment knowledge and can be adapted to a particular application...... by defining a suitable signature and associated equational theory. The logic can furthermore be extended with modalities to yield a modal logic for e.g. the Applied Pi calculus....
BIO Logical Agents: Norms, Beliefs, Intentions in Defeasible Logic
Governatori, Guido; Rotolo, Antonino
2007-01-01
In this paper we follow the BOID (Belief, Obligation, Intention, Desire) architecture to describe agents and agent types in Defeasible Logic. We argue, in particular, that the introduction of obligations can provide a new reading of the concepts of intention and intentionality. Then we examine the notion of social agent (i.e., an agent where obligations prevail over intentions) and discuss some computational and philosophical issues related to it. We show th...
Said-Houari, Belkacem
2017-01-01
This self-contained, clearly written textbook on linear algebra is easily accessible for students. It begins with the simple linear equation and generalizes several notions from this equation for the system of linear equations and introduces the main ideas using matrices. It then offers a detailed chapter on determinants and introduces the main ideas with detailed proofs. The third chapter introduces the Euclidean spaces using very simple geometric ideas and discusses various major inequalities and identities. These ideas offer a solid basis for understanding general Hilbert spaces in functional analysis. The following two chapters address general vector spaces, including some rigorous proofs to all the main results, and linear transformation: areas that are ignored or are poorly explained in many textbooks. Chapter 6 introduces the idea of matrices using linear transformation, which is easier to understand than the usual theory of matrices approach. The final two chapters are more advanced, introducing t...
A study on switched linear system identification using game ...
African Journals Online (AJOL)
A study on switched linear system identification using game-theoretic strategies and neural computing. ... This study deals with application of game-theoretic strategies and neural computing to switched linear ... AJOL African Journals Online.
Proof systems for Moss’ coalgebraic logic
Bílková, M.; Palmigiano, A.; Venema, Y.
2014-01-01
We study Gentzen-style proof theory of the finitary version of the coalgebraic logic introduced by L. Moss. The logic captures the behaviour of coalgebras for a large class of set functors. The syntax of the logic, defined uniformly with respect to a finitary coalgebraic type functor T , uses a
The Dynamic Turn in Quantum Logic
Baltag, A.; Smets, S.
2012-01-01
In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the
Quantum team logic and Bell's inequalities
Hyttinen, T.; Paolini, G.; Väänänen, J.
2015-01-01
A logical approach to Bell’s Inequalities of quantum mechanics has been introduced by Abramsky and Hardy (Abramsky & Hardy, 2012). We point out that the logical Bell’s Inequalities of Abramsky & Hardy (2012) are provable in the probability logic of Fagin, Halpern and Megiddo (Fagin et al., 1990).
The dynamic turn in quantum logic
Baltag, Alexandru; Smets, Sonja
In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the
Translating Dominant Institutional Logics in Practice
DEFF Research Database (Denmark)
Agger Nielsen, Jeppe; Jensen, Tina Blegind
In this paper we examine the proliferation of a new mobile technology in a structured setting of home care in Denmark, focusing on how actions at multiple levels interact to enable technology diffusion and institutionalization. The case study shows how a dominating field level logic...... that combining an institutional logic perspective with a translation perspective furthers our understanding of the malleability of institutional logics....
An Adequate First Order Logic of Intervals
DEFF Research Database (Denmark)
Chaochen, Zhou; Hansen, Michael Reichhardt
1998-01-01
This paper introduces left and right neighbourhoods as primitive interval modalities to define other unary and binary modalities of intervals in a first order logic with interval length. A complete first order logic for the neighbourhood modalities is presented. It is demonstrated how the logic can...... support formal specification and verification of liveness and fairness, and also of various notions of real analysis....
Piaget's Logic of Meanings: Still Relevant Today
Wavering, Michael James
2011-01-01
In his last book, "Toward a Logic of Meanings" (Piaget & Garcia, 1991), Jean Piaget describes how thought can be categorized into a form of propositional logic, a logic of meanings. The intent of this article is to offer this analysis by Piaget as a means to understand the language and teaching of science. Using binary propositions, conjunctions,…
Hybrid Logical Analyses of the Ambient Calculus
DEFF Research Database (Denmark)
Bolander, Thomas; Hansen, Rene Rydhof
2010-01-01
In this paper, hybrid logic is used to formulate three control flow analyses for Mobile Ambients, a process calculus designed for modelling mobility. We show that hybrid logic is very well-suited to express the semantic structure of the ambient calculus and how features of hybrid logic can...
Mathematical Fuzzy Logic - State of Art 2001
Czech Academy of Sciences Publication Activity Database
Hájek, Petr
2003-01-01
Roč. 24, - (2003), s. 71-89 ISSN 0103-9059. [WOLLIC'2001. Brasília, 31.07.2001-03.08.2001] R&D Projects: GA MŠk LN00A056 Keywords : fuzzy logic * many valued logic * basic fuzzy logic BL Subject RIV: BA - General Mathematics http://www.mat.unb.br/~matcont/24_4.pdf
Venema, Y.
This contribution gives a short introduction to arrow logic. We start by explaining the basic idea underlying arrow logic and the motivation for studying it (sections 1 and 2) We discuss some elementary duality theory between arrow logic and the algebraic theory of binary relations (section 3).
General Logic-Systems and Consequence Operators
Herrmann, Robert A.
2005-01-01
In this paper, general logic-systems are investigated. It is shown that there are infinitely many finite consequence operators defined on a fixed language L that cannot be generated from a finite logic-system. It is shown that a set map is a finite consequence operator iff it is defined by a general logic-system.
Against All Odds: When Logic Meets Probability
van Benthem, J.; Katoen, J.-P.; Langerak, R.; Rensink, A.
2017-01-01
This paper is a light walk along interfaces between logic and probability, triggered by a chance encounter with Ed Brinksma. It is not a research paper, or a literature survey, but a pointer to issues. I discuss both direct combinations of logic and probability and structured ways in which logic can
Joos, Georg
1986-01-01
Among the finest, most comprehensive treatments of theoretical physics ever written, this classic volume comprises a superb introduction to the main branches of the discipline and offers solid grounding for further research in a variety of fields. Students will find no better one-volume coverage of so many essential topics; moreover, since its first publication, the book has been substantially revised and updated with additional material on Bessel functions, spherical harmonics, superconductivity, elastomers, and other subjects.The first four chapters review mathematical topics needed by theo
International Nuclear Information System (INIS)
Laval, G.
1988-01-01
The 1988 progress report of the theoretical Physics Center (Ecole Polytechnique, France), is presented. The research activities are carried out in the fields of the supersymmetry theory, the dynamic systems theory, the statistical mechanics, the plasma physics and the random media. Substantial improvements are obtained on dynamical system investigations. In the field theory, the definition of the Gross-Neveu model is achieved. However the construction of the non-abelian gauge theories and the conformal theories are the main research activities. Concerning Astrophysics, a three-dimensional gravitational code is obtained. The activities of each team, and the list of the published papers, congress communications and thesis are given [fr
International Nuclear Information System (INIS)
Anon.
1980-01-01
The nuclear theory program deals with the properties of nuclei and with the reactions and interactions between nuclei and a variety of projectiles. The main areas of concentration are: heavy-ion direct reactions at nonrelativistic energies; nuclear shell theory and nuclear structure; nuclear matter and nuclear forces;intermediate-energy physics and pion-nucleus interactions; and high-energy collisions of heavy ions. Recent progress and plans for future work in these five main areas of concentration and a summary of other theoretical studies currently in progress or recently completed are presented
Magnonic interferometric switch for multi-valued logic circuits
Balynsky, Michael; Kozhevnikov, Alexander; Khivintsev, Yuri; Bhowmick, Tonmoy; Gutierrez, David; Chiang, Howard; Dudko, Galina; Filimonov, Yuri; Liu, Guanxiong; Jiang, Chenglong; Balandin, Alexander A.; Lake, Roger; Khitun, Alexander
2017-01-01
We investigated a possible use of the magnonic interferometric switches in multi-valued logic circuits. The switch is a three-terminal device consisting of two spin channels where input, control, and output signals are spin waves. Signal modulation is achieved via the interference between the source and gate spin waves. We report experimental data on a micrometer scale prototype based on the Y3Fe2(FeO4)3 structure. The output characteristics are measured at different angles of the bias magnetic field. The On/Off ratio of the prototype exceeds 13 dB at room temperature. Experimental data are complemented by the theoretical analysis and the results of micro magnetic simulations showing spin wave propagation in a micrometer size magnetic junction. We also present the results of numerical modeling illustrating the operation of a nanometer-size switch consisting of just 20 spins in the source-drain channel. The utilization of spin wave interference as a switching mechanism makes it possible to build nanometer-scale logic gates, and minimize energy per operation, which is limited only by the noise margin. The utilization of phase in addition to amplitude for information encoding offers an innovative route towards multi-state logic circuits. We describe possible implementation of the three-value logic circuits based on the magnonic interferometric switches. The advantages and shortcomings inherent in interferometric switches are also discussed.
Transcending logic: the difference between contradiction and antinomy
Directory of Open Access Journals (Sweden)
Daniël Strauss
2007-09-01
Full Text Available Philosophy and all the academic disciplines are sensitive to the aim of sound reasoning – except for the dialectical tradition which sanctions contradictions and antinomies (Heraclitus, Nicolas of Cusa, Hegel, Marx, Vaihinger, Simmel, Rex, and Dahrendorf. A brief overview is presented of conflicting theoretical stances within the various academic disciplines before an assessment is given of the positive and negative meaning of ‘reductionism.’ Against the background of historical lines of development the multiple terms employed in this context are mentioned and eventually positioned within the context of the normativity holding for logical thinking. It is argued that the logical contrary between logical and illogical serves as the foundation of other normative contraries, such as legal and illegal and moral and immoral. Through the discovery of irrational numbers the initial Pythagorean conviction that everything is number reverted to a geometrical perspective that generated a static metaphysics of being which challenged the ideas of plurality and motion. This development uncovered the problem of primitive terms in scientific discourse as an alternative for those theoretical attempts aimed at reducing whatever there is to one single mode of explanation. Zeno’s paradoxes are used to demonstrate an alternative understanding of the difference between the potential and the actual infinite as well as the nature of (theoretical antinomies. It is argued that genuine antinomies are inter-modal in nature (such as is found in the attempt to reduce movement to static positions in space and therefore differ from logical contradictions (such as a ‘square circle’ which merely confuses two figures within one modal aspect. Although every antinomy does entail logical contradictions, the latter do not necessarily presuppose an antinomy. The implication is that logic itself has an ontic foundation – as is seen from the nature of the principle of
Applications of Logic Coverage Criteria and Logic Mutation to Software Testing
Kaminski, Garrett K.
2011-01-01
Logic is an important component of software. Thus, software logic testing has enjoyed significant research over a period of decades, with renewed interest in the last several years. One approach to detecting logic faults is to create and execute tests that satisfy logic coverage criteria. Another approach to detecting faults is to perform mutation…
Optical NOR logic gate design on square lattice photonic crystal platform
Energy Technology Data Exchange (ETDEWEB)
D’souza, Nirmala Maria, E-mail: nirmala@cukerala.ac.in; Mathew, Vincent, E-mail: vincent@cukerala.ac.in [Department of Physics, Central University of Kerala, Kasaragod, Kerala-671 314 (India)
2016-05-06
We numerically demonstrate a new configuration of all-optical NOR logic gate with square lattice photonic crystal (PhC) waveguide using finite difference time domain (FDTD) method. The logic operations are based on interference effect of optical waves. We have determined the operating frequency range by calculating the band structure for a perfectly periodic PhC using plane wave expansion (PWE) method. Response time of this logic gate is 1.98 ps and it can be operated with speed about 513 GB/s. The proposed device consists of four linear waveguides and a square ring resonator waveguides on PhC platform.
DEFF Research Database (Denmark)
Bresolin, Davide; Goranko, Valentin; Montanari, Angelo
2009-01-01
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontological entities. In this paper we introduce and study Right Propositional Neighborhood Logic over natural numbers...... with integer constraints for interval lengths, which is a propositional interval temporal logic featuring a modality for the 'right neighborhood' relation between intervals and explicit integer constraints for interval lengths. We prove that it has the bounded model property with respect to ultimately periodic...
The latitude of logic in legal hermeneutics
Directory of Open Access Journals (Sweden)
Medar Suzana
2014-01-01
Full Text Available Legal hermeneutics (the interpretation of law] has always taken a highly significant place in general hermeneutics. The interpretation of laws involves an intricate task of determining the real meaning or rationale of legal norms. Considering the complexity of this goal, the most frequent classification of legal hermeneutics is based on the interpretation instruments. In traditional theory, the most widely recognized instruments for the interpretation of legal norms are language, logic, legal system, history and purpose of a legal norm. Under the influence of general analytic philosophy, the particular interest in language as the basic instrument for the interpretation of law may be found in mid-20th century. The interest in the language of law is closely related to the study of legal logic and legal argumentation. In theory, there is no dispute about the logical interpretation in a narrow sense which is based on drawing true conclusions by applying the basic rule of formal reasoning. Yet, it has given a head start to argumentation as 'a problem-based reasoning skill' which provides answers to the questions raised in contentious cases. Argumentation is closely associated with the dialectic method of reasoning (which has been widely recognized since the Ancient Greece], where conclusions are based on probable premises. One of the most significant goals of the argumentation theory is to locate the sources or common grounds for developing arguments; these basic argumentative patterns are generally known as 'topoi' or 'loci, sedes argumentorum'. On the other hand, 'topica' is part of rhetoric art dealing with the theoretical explanation of the basic argumentative patterns (topoi] and how they are structured, including the location of new topoi and arguments. The most significant proponents of the topical reasoning are Chaïm Perelman and Theodor Viehweg. Perelman relates topical reasoning to judicial reasoning and considers that specific legal topoi
Stöltzner, Michael
Answering to the double-faced influence of string theory on mathematical practice and rigour, the mathematical physicists Arthur Jaffe and Frank Quinn have contemplated the idea that there exists a `theoretical' mathematics (alongside `theoretical' physics) whose basic structures and results still require independent corroboration by mathematical proof. In this paper, I shall take the Jaffe-Quinn debate mainly as a problem of mathematical ontology and analyse it against the backdrop of two philosophical views that are appreciative towards informal mathematical development and conjectural results: Lakatos's methodology of proofs and refutations and John von Neumann's opportunistic reading of Hilbert's axiomatic method. The comparison of both approaches shows that mitigating Lakatos's falsificationism makes his insights about mathematical quasi-ontology more relevant to 20th century mathematics in which new structures are introduced by axiomatisation and not necessarily motivated by informal ancestors. The final section discusses the consequences of string theorists' claim to finality for the theory's mathematical make-up. I argue that ontological reductionism as advocated by particle physicists and the quest for mathematically deeper axioms do not necessarily lead to identical results.
Nanowire NMOS Logic Inverter Characterization.
Hashim, Yasir
2016-06-01
This study is the first to demonstrate characteristics optimization of nanowire N-Channel Metal Oxide Semiconductor (NW-MOS) logic inverter. Noise margins and inflection voltage of transfer characteristics are used as limiting factors in this optimization. A computer-based model used to produce static characteristics of NW-NMOS logic inverter. In this research two circuit configuration of NW-NMOS inverter was studied, in first NW-NMOS circuit, the noise margin for (low input-high output) condition was very low. For second NMOS circuit gives excellent noise margins, and results indicate that optimization depends on applied voltage to the inverter. Increasing gate to source voltage with (2/1) nanowires ratio results better noise margins. Increasing of applied DC load transistor voltage tends to increasing in decreasing noise margins; decreasing this voltage will improve noise margins significantly.
Programming Games for Logical Thinking
Directory of Open Access Journals (Sweden)
H. Tsalapatas
2013-03-01
Full Text Available Analytical thinking is a transversal skill that helps learners synthesize knowledge across subject areas; from mathematics, science, and technology to critical reading, critical examination, and evaluation of lessons. While most would not doubt the importance of analytical capacity in academic settings and its growing demand for the skill in professional environments, school curricula do not comprehensively address its development. As a result, the responsibility for structuring related learning activities falls to teachers. This work examines learning paradigms that can be integrated into mathematics and science school education for developing logical thinking through game-based exercises based on programming. The proposed learning design promotes structured algorithmic mindsets, is based on inclusive universal logic present in all cultures, and promotes constructivism educational approaches encouraging learners to drive knowledge building by composing past and emerging experiences.
An Embedded Reconfigurable Logic Module
Tucker, Jerry H.; Klenke, Robert H.; Shams, Qamar A. (Technical Monitor)
2002-01-01
A Miniature Embedded Reconfigurable Computer and Logic (MERCAL) module has been developed and verified. MERCAL was designed to be a general-purpose, universal module that that can provide significant hardware and software resources to meet the requirements of many of today's complex embedded applications. This is accomplished in the MERCAL module by combining a sub credit card size PC in a DIMM form factor with a XILINX Spartan I1 FPGA. The PC has the ability to download program files to the FPGA to configure it for different hardware functions and to transfer data to and from the FPGA via the PC's ISA bus during run time. The MERCAL module combines, in a compact package, the computational power of a 133 MHz PC with up to 150,000 gate equivalents of digital logic that can be reconfigured by software. The general architecture and functionality of the MERCAL hardware and system software are described.
The Relevance of Hegel's Logic
Directory of Open Access Journals (Sweden)
John W Burbidge
2007-12-01
Full Text Available Hegel defines his Logic as the science that thinks about thinking.nbsp; But when we interpret that work as outlining what happens when we reason we are vulnerable to Fregersquo;s charge of psychologism.nbsp; I use Hegelrsquo;s tripartite distinction among understanding, dialectical and speculative reason as operations of pure thought to suggest how thinking can work with objective concepts.nbsp; In the last analysis, however, our ability to move from the subjective contingency of representations and ideas to the pure concepts we think develops from mechanical memory, which separates sign from sense so hat we can focus simply on the latter.nbsp; By becoming aware of the connections that underlie our thinking processes we may be able to both move beyond the abstractions of symbolic logic and clarify what informal logicians call relevance.
Contextual Validity in Hybrid Logic
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2013-01-01
interpretations. Moreover, such indexicals give rise to a special kind of validity—contextual validity—that interacts with ordinary logi- cal validity in interesting and often unexpected ways. In this paper we model these interactions by combining standard techniques from hybrid logic with insights from the work...... of Hans Kamp and David Kaplan. We introduce a simple proof rule, which we call the Kamp Rule, and first we show that it is all we need to take us from logical validities involving now to contextual validities involving now too. We then go on to show that this deductive bridge is strong enough to carry us...... to contextual validities involving yesterday, today and tomorrow as well....
Fuzzy Versions of Epistemic and Deontic Logic
Gounder, Ramasamy S.; Esterline, Albert C.
1998-01-01
Epistemic and deontic logics are modal logics, respectively, of knowledge and of the normative concepts of obligation, permission, and prohibition. Epistemic logic is useful in formalizing systems of communicating processes and knowledge and belief in AI (Artificial Intelligence). Deontic logic is useful in computer science wherever we must distinguish between actual and ideal behavior, as in fault tolerance and database integrity constraints. We here discuss fuzzy versions of these logics. In the crisp versions, various axioms correspond to various properties of the structures used in defining the semantics of the logics. Thus, any axiomatic theory will be characterized not only by its axioms but also by the set of properties holding of the corresponding semantic structures. Fuzzy logic does not proceed with axiomatic systems, but fuzzy versions of the semantic properties exist and can be shown to correspond to some of the axioms for the crisp systems in special ways that support dependency networks among assertions in a modal domain. This in turn allows one to implement truth maintenance systems. For the technical development of epistemic logic, and for that of deontic logic. To our knowledge, we are the first to address fuzzy epistemic and fuzzy deontic logic explicitly and to consider the different systems and semantic properties available. We give the syntax and semantics of epistemic logic and discuss the correspondence between axioms of epistemic logic and properties of semantic structures. The same topics are covered for deontic logic. Fuzzy epistemic and fuzzy deontic logic discusses the relationship between axioms and semantic properties for these logics. Our results can be exploited in truth maintenance systems.
The PLC: a logical development
Walker, Mark; Bissell, Christopher; Monk, John
2010-01-01
Programmable Logic Controllers (PLCs) have been used to control industrial processes and equipment for over 40 years, having their first commercially recognised application in 1969. Since then there have been enormous changes in the design and application of PLCs, yet developments were evolutionary rather than radical. The flexibility of the PLC does not confine it to industrial use and it has been used for disparate non-industrial control applications . This article reviews the history, deve...
Logic Learning in Hopfield Networks
Sathasivam, Saratha; Abdullah, Wan Ahmad Tajuddin Wan
2008-01-01
Synaptic weights for neurons in logic programming can be calculated either by using Hebbian learning or by Wan Abdullah's method. In other words, Hebbian learning for governing events corresponding to some respective program clauses is equivalent with learning using Wan Abdullah's method for the same respective program clauses. In this paper we will evaluate experimentally the equivalence between these two types of learning through computer simulations.
Is special relativity logically inconsistent
International Nuclear Information System (INIS)
Prokhovnik, S.J.
1980-01-01
The author gives his view that Special Relativity is logically and mathematically consistent, as well as physically comprehensible if, and only if, it is firmly based on the single assumption of a unique fundamental reference frame for light propagation. The theory and all its results are derivable from this assumption; the Relativity and Light Principles become intelligible consequences of this assumption; the physical significance and source of time dilation and length contraction are made manifest thereby. (Auth.)
Cosmic logic: a computational model
International Nuclear Information System (INIS)
Vanchurin, Vitaly
2016-01-01
We initiate a formal study of logical inferences in context of the measure problem in cosmology or what we call cosmic logic. We describe a simple computational model of cosmic logic suitable for analysis of, for example, discretized cosmological systems. The construction is based on a particular model of computation, developed by Alan Turing, with cosmic observers (CO), cosmic measures (CM) and cosmic symmetries (CS) described by Turing machines. CO machines always start with a blank tape and CM machines take CO's Turing number (also known as description number or Gödel number) as input and output the corresponding probability. Similarly, CS machines take CO's Turing number as input, but output either one if the CO machines are in the same equivalence class or zero otherwise. We argue that CS machines are more fundamental than CM machines and, thus, should be used as building blocks in constructing CM machines. We prove the non-computability of a CS machine which discriminates between two classes of CO machines: mortal that halts in finite time and immortal that runs forever. In context of eternal inflation this result implies that it is impossible to construct CM machines to compute probabilities on the set of all CO machines using cut-off prescriptions. The cut-off measures can still be used if the set is reduced to include only machines which halt after a finite and predetermined number of steps
Directory of Open Access Journals (Sweden)
Avram Mihai
2017-01-01
Full Text Available The paper presents a linear pneumatic actuator with short working stroke. It consists of a pneumatic motor (a simple stroke cylinder or a membrane chamber, two 2/2 pneumatic distributors “all or nothing” electrically commanded for controlling the intake/outtake flow to/from the active chamber of the motor, a position transducer and a microcontroller. There is also presented the theoretical analysis (mathematical modelling and numerical simulation accomplished.
Avram Mihai; Niţu Constantin; Bucşan Constantin; Grămescu Bogdan
2017-01-01
The paper presents a linear pneumatic actuator with short working stroke. It consists of a pneumatic motor (a simple stroke cylinder or a membrane chamber), two 2/2 pneumatic distributors “all or nothing” electrically commanded for controlling the intake/outtake flow to/from the active chamber of the motor, a position transducer and a microcontroller. There is also presented the theoretical analysis (mathematical modelling and numerical simulation) accomplished.
Hybrid Logic and its Proof-Theory
Brauner, Torben
2011-01-01
This is the first book-length treatment of hybrid logic and its proof-theory. Hybrid logic is an extension of ordinary modal logic which allows explicit reference to individual points in a model (where the points represent times, possible worlds, states in a computer, or something else). This is useful for many applications, for example when reasoning about time one often wants to formulate a series of statements about what happens at specific times. There is little consensus about proof-theory for ordinary modal logic. Many modal-logical proof systems lack important properties and the relatio
A Resolution Prover for Coalition Logic
Directory of Open Access Journals (Sweden)
Cláudia Nalon
2014-04-01
Full Text Available We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolution-based calculus for Coalition Logic. We then give details of the implementation of CLProver and present the results for a comparison with an existing tableau-based solver.
Logic and discrete mathematics a concise introduction
Conradie, Willem
2015-01-01
A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy
Logical design for computers and control
Dodd, Kenneth N
1972-01-01
Logical Design for Computers and Control Logical Design for Computers and Control gives an introduction to the concepts and principles, applications, and advancements in the field of control logic. The text covers topics such as logic elements; high and low logic; kinds of flip-flops; binary counting and arithmetic; and Boolean algebra, Boolean laws, and De Morgan's theorem. Also covered are topics such as electrostatics and atomic theory; the integrated circuit and simple control systems; the conversion of analog to digital systems; and computer applications and control. The book is recommend
Asynchronous Operators of Sequential Logic Venjunction & Sequention
Vasyukevich, Vadim
2011-01-01
This book is dedicated to new mathematical instruments assigned for logical modeling of the memory of digital devices. The case in point is logic-dynamical operation named venjunction and venjunctive function as well as sequention and sequentional function. Venjunction and sequention operate within the framework of sequential logic. In a form of the corresponding equations, they organically fit analytical expressions of Boolean algebra. Thus, a sort of symbiosis is formed using elements of asynchronous sequential logic on the one hand and combinational logic on the other hand. So, asynchronous
Solow, Daniel
2014-01-01
This text covers the basic theory and computation for a first course in linear programming, including substantial material on mathematical proof techniques and sophisticated computation methods. Includes Appendix on using Excel. 1984 edition.
Liesen, Jörg
2015-01-01
This self-contained textbook takes a matrix-oriented approach to linear algebra and presents a complete theory, including all details and proofs, culminating in the Jordan canonical form and its proof. Throughout the development, the applicability of the results is highlighted. Additionally, the book presents special topics from applied linear algebra including matrix functions, the singular value decomposition, the Kronecker product and linear matrix equations. The matrix-oriented approach to linear algebra leads to a better intuition and a deeper understanding of the abstract concepts, and therefore simplifies their use in real world applications. Some of these applications are presented in detailed examples. In several ‘MATLAB-Minutes’ students can comprehend the concepts and results using computational experiments. Necessary basics for the use of MATLAB are presented in a short introduction. Students can also actively work with the material and practice their mathematical skills in more than 300 exerc...
Berberian, Sterling K
2014-01-01
Introductory treatment covers basic theory of vector spaces and linear maps - dimension, determinants, eigenvalues, and eigenvectors - plus more advanced topics such as the study of canonical forms for matrices. 1992 edition.
Searle, Shayle R
2012-01-01
This 1971 classic on linear models is once again available--as a Wiley Classics Library Edition. It features material that can be understood by any statistician who understands matrix algebra and basic statistical methods.
Christofilos, N.C.; Polk, I.J.
1959-02-17
Improvements in linear particle accelerators are described. A drift tube system for a linear ion accelerator reduces gap capacity between adjacent drift tube ends. This is accomplished by reducing the ratio of the diameter of the drift tube to the diameter of the resonant cavity. Concentration of magnetic field intensity at the longitudinal midpoint of the external sunface of each drift tube is reduced by increasing the external drift tube diameter at the longitudinal center region.
Analysis of Linear Hybrid Systems in CLP
DEFF Research Database (Denmark)
Banda, Gourinath; Gallagher, John Patrick
2009-01-01
In this paper we present a procedure for representing the semantics of linear hybrid automata (LHAs) as constraint logic programs (CLP); flexible and accurate analysis and verification of LHAs can then be performed using generic CLP analysis and transformation tools. LHAs provide an expressive...
Theoretical Provision of Tax Transformation
Directory of Open Access Journals (Sweden)
Feofanova Iryna V.
2016-05-01
Full Text Available The article is aimed at defining the questions, giving answers to which is necessary for scientific substantiation of the tax transformation in Ukraine. The article analyzes the structural-logical relationships of the theories, providing substantiation of tax systems and transformation of them. Various views on the level of both the tax burden and the distribution of the tax burden between big and small business have been systematized. The issues that require theoretical substantiation when choosing a model of tax system have been identified. It is determined that shares of both indirect and direct taxes and their rates can be substantiated by calculations on the basis of statistical data. The results of the presented research can be used to develop the algorithm for theoretical substantiation of tax transformation