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 16 of 16 for “"Rules of Inference"”.
-
The Lattice of Equational Classes of Commutative Semigroups
… semigroup equations are described, and rules of inference for them are given. Then a skeleton sublattice of the lattice of equational classes of commutative semigroups is described, and a partial description is given of the way in which the rest of the lattice hangs on the skeleton.</p>
-
Proof: an implementation of theorem-proving with equality
… has, in the past, been hindered by the lack of an efficient method of treating the equality relation. A system (developed by E. E. Sibert) of first-order logic has been defined based on the structure of the equality relation. The program PROOF implements this system on the Rice University …
-
Foundations of Deduction's Pedigree: A Non-Inferential Account
… associated with the epistemological task of arriving at basic logical knowledge. This is knowledge that the primitive rules of inference we use in deductive reasoning are correct. Knowledge of correctness, like all knowledge, is available to us either as the product of inference, or it is …
-
Godel's theorem - its place in mathematical history
As is so often true in history, the importance of an event cannot fully be judged or appreciated unless it is being weighed in light of the prevailing situation of the period. Godel's discovery came at a time when mathematicians generally were looking for a means by which they might fully …
-
Solving Quantified Boolean Formulas
… Boolean Formulas Horst Samulowitz Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2008 Many real-world problems do not have a simple algorithmic solution and casting these problems as search problems is often not only the simplest way of casting them, but …
-
Computational Natural Deduction
The formalization of the notion of a logically sound argument as a natural deduction proof offers the prospect of a computer program capable of constructing such arguments for conclusions of interest. We present a constructive definition for a new subclass of natural deduction proofs, called atomic …
-
A computer model for axiomatic systems
This dissertation describes the development of a computer system that can be used for informal axiomatic investigation of mathematics. A formal mathematics-like language is defined which enables a mathematician to write informal mathematical statements and proofs. Each step of a proof is checked …
-
Unfenced existence
… existence' to abbreviate the negation of this claim. In order to defend necessary existence, I clarify what I mean by 'exists'. I argue that there are many different senses of 'exists', and exactly one of these senses is appropriate for the purposes of philosophical logic and modal …
-
The Power of a Paradox: the Ancient and Contemporary Liar
… is whatever truth is <em>not</em>. The subject of this master’s thesis is the power, influence, and solvability of the liar paradox. This paradox can be constructed through the application of a standard conception of truth and rules of inference are applied to sentences such as the first …
-
In Defense of the Direct Argument for Incompatibilism
… moral responsibility compatible with the truth of causal determinism? One of the most influential arguments that moral responsibility is <em>incompatible</em> with causal determinism is the so-called ‘Direct Argument,’ developed by Peter van Inwagen in his <em>An Essay on Free Will</em>. …
-
Geometric ergodicity of a random-walk metorpolis algorithm via variable transformation and computer aided reasoning in statistics.
With the steady increase of affordable computing, more and more often analysts are turning to computationally intensive techniques like Markov chain Monte Carlo (MCMC). To properly quantify the quality of their MCMC estimates, analysts need to know how quickly the Markov chain converges. Geometric …
-
Deductive systems and finite axiomatization properties
<p>The notions of a deductive system, equational logic and Gentzen system can be generalized into the notion of a K-deductive system. A universal Horn logic is also a K-deductive system. In Part I the relationship between the existence of equivalence K-terms in a K-deductive system and some …
-
Μαθηματική μοντελοποίηση με χρήση της ασαφούς λογικής με εφαρμογές σε θέματα μηχανικών
Fuzzy logic is the generalization of the classical two-valued logic and as an effect the classical set theory. The ability of fuzzy logic to describe sets and systems, in which ambiguity is present, makes fuzzy logic a fundamental part of computational intelligence. In particular, fuzzy logic and …
-
What the Tortoise Said to Kripke: the Adoption Problem and the Epistemology of Logic
… topics to be addressed and provide a summary of the dissertation. In chapter 2 I summarize Lewis Carroll's famous note "What the Tortoise Said to Achilles" and briefly review some of its most influential interpretations. The rest of the chapter is devoted to Kripke's unpublished interpretation …
-
Commonsense agent reasoning by exploiting knowledge graphs and computational argumentation
… reasoning in order to perform a task on behalf of or take a decision to help a human user, usually in open environments, which are dynamic, partially observable, and non-deterministic, where agents possess incomplete, imprecise, or even conflicting information. The aim of this thesis is to study …
-
The principle of explosion: a study in love, loss, and logic
… word hybrid memoir/biography, The Principle of Explosion: A Study in Love, Loss and Logic, braids the story of my estrangement from my mother—a lesbian Desert Storm veteran and early follower of the conspiracy theorist Alex Jones—with the logician Bertrand Russell's failed search for …