Spelling suggestions: "subject:"logic, symbolic anda mathematical"" "subject:"logic, symbolic ando mathematical""
51 |
Proof-theoretical investigations in catagorical algebra.Szabo, M. E. January 1971 (has links)
No description available.
|
52 |
The application of symbolic logic to plant locationSmidt, Robert Martin. January 1961 (has links)
Call number: LD2668 .T4 1961 S63
|
53 |
Wittgenstein's Tractatus : a historical and critical commentaryShwayder, D. S. January 1954 (has links)
No description available.
|
54 |
Model checking concurrent object oriented scoop programs /Huang, Hai Feng. January 2007 (has links)
Thesis (M.Sc.)--York University, 2007. Graduate Programme in Computer Science. / Typescript. Includes bibliographical references (leaves 153-157). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR38783
|
55 |
Meaning and existence in mathematics : on the use and abuse of the theory of models in the philosophy of mathematics.Castonguay, Charles. January 1971 (has links)
No description available.
|
56 |
On the logics of algebra.Barbour, Graham. January 2008 (has links)
We present and consider a number of logics that arise naturally from universal algebraic considerations, but which are ‘inherently unalgebraizable’ in the sense of [BP89a], essentially because they have no theo- rems. Of particular interest is the membership logic of a quasivariety, which is determined by its theorems, which are the relative congruence classes of the term algebra together with the empty-set in the case that the quasivariety is non-trivial. The membership logic arises by a more general technique developed in this text, for inducing deductive systems from closed systems on the free algebras of quasivarieties. In order to formalize this technique, we develop a theory of logics over constructs, where constructs are concrete categories. With this theory in place, we are able to view a closed system over an algebra as a logic, and in particular a structural logic, structural with respect to a suitable construct, typically the construct con- sisting of all algebras in a quasivariety and all algebra homomorphisms between these algebras. Of course, in such a case, none of these logics are generally sentential (i.e., structural and finitary deductive systems in the sense of [BP89a]), since the formulae of sentential logics arise from the terms of the absolutely free term algebra, which is generally not a member of the quasivariety under interest. In such cases, where the term algebra is not a member of a quasivariety, the free algebra of the quasivariety on denumerably countable free generators takes on the role played by the term algebra in sentential logics. Many of the logics that we encounter in this text arise most naturally as finitary logics on this free algebra of the quasivariety and generally are structural with respect to the quasivariety. We call such logics canons, and show how such structural canons induce sentential calculi, which we call the induced ideal ; the filters of the ideal on the free algebra are precisely the theories of the canon. The membership logic is the ideal of the cannon whose theories are the relative congruence classes on the free algebra. The primary aim of this thesis is to provide a unifying framework for logics of this type which extends the Blok-Pigozzi theory of elementarily algebraizable (and protoalgebraic) deductive systems. In this extension there are two parameters: a set of formulae and a variable. When the former is empty or consists of theorems, the Blok-Pigozzi theory is recovered, and the variable is redundant. For the membership logic, the appropriate variant of equivalent algebraic semantics encompasses the relatively congruence regular quasivarieties. These results have appeared in [BR03]. The secondary aim of this thesis is to analyse our theory of parameterized algebraization from a non- parameterized perspective. To this end, we develop a theory of protoalgebraic logics over constructs and equivalence between logics from different constructs, which we then use to explain the results we obtained in our parameterized theories of protoalgebraicity, algebraic semantics and equivalent algebraic semantics. We relate this theory to the theory of deductively equivalent -institutions [Vou03], and as a consequence obtain a number of improved and new results in the field of categorical abstract algebraic logic. We also use our theory of protoalgebraic logics over constructs to obtain a new and simpler characterization of structural finitary n-deductive systems, which we then use to close the program begun in [BR99], by extending those results for 1-deductive systems to n-deductive systems, and in particular characterizing the protoalgebraicity of the sentential n-deductive system Sn(K,N), which is the natural extension of the 1-deductive system S(K, ) introduce in [BR99], in terms of the quasivariety K having hK,Ni-coherent N-classes (we cannot see how to obtain this result from the standard characterization of protoalgebraic n- deductive systems of [Pal03], which is very complex). With respect to this program of completing [BR99], we also show that a quasivariety K is an equivalent algebraic semantics for a n-deductive system with defining equations N iff K is hK,Ni-regular; a notion of regularity that we introduce and characterize by a quasi-Mal’cev condition. The third aim of this text is to unify as many disparate arguments and notions in algebraic logic under the banner of continuous translations between closed systems, where our use of the term continuous is in the topological sense rather than in the order-theoretic sense, and, where possible, to give elementary, i.e. first order, definitions and proofs. To this end, we show that closed systems, closure operators and conse- quence relations can all be characterized elementarily over orders, and put into one-to-one correspondence that reflects exactly, the standard correspondences between the well-known concrete notions with the same name. We show that when the order is the complete power order over a set, then these elementary structures coincide with their well-known counterparts with the same name. We also introduce two other elementary structures over orders, namely the closed equivalence relation and something we term the proto-Leibniz relation; these elementary structures are also in one-to-one correspondence with the earlier mentioned structures; we have not seen concrete versions of these structures. We then characterize the structure homomorphisms between these structures, as well as considering galois relations between them; galois relations are pairs of order-preserving function in opposite directions; we call these translations, and they are elementary notions. We demonstrate how notions as disparate as structurality, semantics, algebraic semantics, the filter correspondence property, filters, models, semantic consequence, protoalge- braicity and even the logic S(K, ) of [BR99] and our logic Sn(K,N), all fall within this framework, as does much of our parameterized theory and much of the theory of -institutions. A brief summary of the standard theory of deductive systems and their algebraization is provided for the reader unfamiliar with algebraic logics, as well as the necessary background material, including construct and category theory, the theory of structures and algebras, and the model theory of structures with and without equality. / Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2008.
|
57 |
Second-order logic : ontological and epistemological problemsRossberg, Marcus January 2006 (has links)
In this thesis I provide a survey over different approaches to second-order logic and its interpretation, and introduce a novel approach. Of special interest are the questions whether (a particular form of) second-order logic can count as logic in some (further to be specified) proper sense of logic, and what epistemic status it occupies. More specifically, second-order logic is sometimes taken to be mathematical, a mere notational variant of some fragment of set theory. If this is the case, it might be argued that it does not have the "epistemic innocence" which would be needed for, e.g., foundational programmes in (the philosophy of) mathematics for which second-order logic is sometimes used. I suggest a Deductivist conception of logic, that characterises logical consequence by means of inference rules, and argue that on this conception second-order logic should count as logic in the proper sense.
|
58 |
Some results concerning intuitionistic logical categoriesTennenhouse, Karen Heather. January 1975 (has links)
No description available.
|
59 |
A comparative analysis of Wittgenstein's 'Tractatus' and Śaṁkara's Advaita Vedānta with an introduction to the logic of comparative methodologyGoldenberg, Daniel S January 1977 (has links)
Typescript. / Thesis (Ph. D.)--University of Hawaii at Manoa, 1977. / Bibliography: leaves 201-216. / Microfiche. / xxxi, 216 leaves
|
60 |
The likeness regress : Plato's Parmenides 132c12-133a7 /Otto, Karl Darcy. Hitchcock, David, January 1900 (has links)
Thesis (Ph.D.)--McMaster University, 2003. / Advisor: David L. Hitchcock. Includes bibliographical references (leaves 144-147). Also available via World Wide Web.
|
Page generated in 0.1149 seconds