Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 18 of 18 for “"classical logic"”.
-
Classical logic and its rivals
Classical logic and a given nonclassical logic are, by definition, incompatible in some sense. In some cases, this incompatibility is innocuous. In other cases, the nonclassical logic is incompatible with classical logic on a fundamental level, such that the two logics can be seen as rival theories …
-
A Non-Classical Solution To Vague Persistence
… that this claim is based on an assumption of classical logic and that by rejecting this assumption in favor of a non-classical logic the objection is rendered mute. By revising our understanding of the identity relation to function on a continuum scale we can understand persistence as a scalar …
-
Algebraic aspects of propositional logic
… between abstract algebra and propositional logic. We start by considering the category Bool of Boolean algebras, the algebraic counterpart of classical propositional logic. We provide an algebraic definition of theories and models of classical logic and provide algebraic algorithms to …
-
Tri-state gates in logical networks
… the use of tri-state gates in the design of logic networks. Special considerations for the use of tri-state gates are discussed in order that the reader might get a feel for the capability of tri-state logic and so that he will be aware of problems which may appear in the course of the design …
-
Interpreting Negation: A Semantic Theory of Negation for Standard and Non-Standard Logics
… a common core to the negation operators found in classical logic, quantum logic and some versions of three-valued logic--logics I refer to an 'valent' logics. In particular, each of these operators adheres to the following three constraints: (1) A proposition and its negation cannot intersect in a …
-
Model theory and probability
… author uses a continuous version of first order logic that has been developed recently and that is better suited for applications to metric structures than classical first order logic. The set of truth values in continuous logic is the interval [0,1] instead of the truth values {True, False} in …
-
Action, Time and Space in Description Logics
Description Logics (DLs) are a family of logic-based knowledge representation (KR) formalisms designed to represent and reason about static conceptual knowledge in a semantically well-understood way. On the other hand, standard action formalisms are KR formalisms based on classical logic designed …
-
KLM-Style Defeasible Reasoning for Datalog
… those related to mathematics and philosophy, classical logic has enjoyed great success as a model of valid reasoning and discourse. For real-world reasoning tasks, however, an agent typically only has partial knowledge of its domain, and at most a statistical understanding of relationships …
-
Graphical structure of unsatisfiable boolean formulae
… graph theory, this new variant builds upon the classical logic and computer science problem of boolean satisfiability k-SAT. k-SAT asks if there exists a truth assignment that satisfies a given boolean formula. Our variant deals with multi-hypergraphs instead of boolean formulae and uses truth …
-
TOPIC SENSITIVE BELIEF REVISION
… In this dissertation, I explore theories of logical topicality and their effect on formal theories of belief revision. Formal theories of belief revision (in the Alchourrón, Gärdenfors, and Makinson (AGM) tradition) model the object of change (my beliefs, a book) as a collection of formulae …
-
Assertibility and coordination: Analysing `and' and/or `or', some `some', but not so much `but', `not', `so', or `nor', nor `much'
This thesis explores how far classical logic, combined with formal restrictions that model some Grice-inspired maxims, can go towards describing the multiple distinct uses of the English natural language connectives `and' and `or'. H.P. Grice famously claimed that `and' and `if' could be completely …
-
An overview of KLM-style defeasible entailment
The usage of formal logic to solve problems in artificial intelligence has a long history in the field. Information is represented in a formal language, which facilitates algorithmic reasoning about some domain knowledge. Traditionally, the algorithms used for the reasoning services are monotonic, …
-
Cubical Models of Homotopy Type Theory - An Internal Approach
… this construction makes fundamental use of classical logic in order to show certain results. Therefore this model cannot be used to explain the computational content of the univalence axiom, such as how to compute terms involving univalence. This problem was resolved by Cohen, Coquand, Huber …
-
The Proscriptive Principle and Logics of Analytic Implication
<p>The analogy between inference and mereological containment goes at least back to Aristotle, whose discussion in the <em>Prior Analytics</em> motivates the validity of the syllogism by way of talk of parts and wholes. On this picture, the application of syllogistic is merely the <em>analysis</em> …
-
MATERIALS CHARACTERIZATION FOR SUB-MICRON SUPERCONDUCTING INTERCONNECTS IN RECIPROCAL QUANTUM LOGIC CIRCUITS
… considerable amount of energy.Reciprocal Quantum Logic (RQL) is a classical logic family within superconducting electronics, and is a candidate for energy efficient computing technologies. Similar to the current complimentary metal-oxide semiconductor technologies, RQL interconnects are …
-
Information spread in networks: games, optimal control, and stabilization
… that describes virus spread in computer and biological networks. We seek to design optimal, robust, and stabilizing controllers under practical constraints. For distributed averaging networks, we study the interaction between a network designer and an adversary. We consider two types of attacks …
-
Deep Inference and Symmetry in Classical Proofs
In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry, which provides an involution on derivations. Like sequent systems, they have a cut rule which is …
-
TRACTABLE DEPTH-BOUNDED APPROXIMATIONS TO SOME PROPOSITIONAL LOGICS. TOWARDS MORE REALISTIC MODELS OF LOGICAL AGENTS.
… of reasoners. Recognizing that most useful logics are idealizations in that they are either undecidable or likely to be intractable, the approach accounts for how they can be approximated in practice by resource-bounded agents. The approach has been applied to Classical Propositional Logic …