DOCSLIB.ORG

Towards a Standard Completeness for a Probabilistic Logic on Infinite

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Towards a Standard Completeness for a Probabilistic Logic on Infinite Towards a standard completeness for a probabilistic logic on infinite-valued events Tommaso Flaminio Artificial Intelligence Research Institute (IIIA - CSIC) Campus de la Univ. Aut`onomade Barcelona s/n, 08193 Bellaterra, Spain. [email protected] Abstract. MV-algebras with internal states, or SMV-algebras for short, are the equivalent algebraic semantics of the logic SFP(L ; L)which allows to represent and reason about the probability of infinite-valued events. In this paper we will make the first steps towards establishing complete- ness for SFP(L ; L)with respect to the class of standard SMV-algebras, a problem which has been left open since the first paper on SMV-algebras was published. More precisely we will prove that, if we restrict our atten- tion to a particular, yet expressive, subclass of formulas, then theorems of SFP(L ; L)are the same as tautologies of a class of SMV-algebras that can be reasonably called \standard". Keywords. MV-algebras, states, internal states, standard completeness, probabilistic logic. 1 Introduction MV-algebras with an internal state, or SMV-algebras, have been introduced in [6] and they consist of an MV-algebra A (cf. [2]) and a unary map σ on A axiomatized so as to preserve some basic properties of a state of A (cf. [12, 5]), i.e., a [0; 1]-valued, normalized and finitely additive function. These structures form a variety, denoted by SMV, which is the equivalent algebraic semantics for the probabilistic logic SFP(L ; L) which permits to represent and reason about the probability of infinite-valued events. In that logic, in particular, events are described by formulas of the infinite-valuedLukasiewicz calculus (cf. [2]). From the perspective of reasoning about uncertainty, the interest ofLukasie- wicz events is twofold: whilst capturing properties of the world which are better described as gradual rather than yes-or-no, they also mimic bounded random variables. Indeed, anyLukasiewicz event e may be regarded as a [0; 1]-valued continuous function e∗ on a compact Hausdorff space (see [2, Theorem 9.1.5] and Section 2) and any state of e coincides with the expected value of e∗ (see [4, Remark 2.8] and Section 3). SMV-algebras provide a framework to treat a generalization of classical prob- ability theory in a universal-algebraic setting. However, notwithstanding their meaningful expressive power, several problem concerning their universal-algebraic properties are still open. Here, we will concentrate on the following issue: de- termining a proper subclass of SMV-algebras which generates SMV and which could be regarded as a class of \measure-theoretical" models. In other words, the above problem is to establishing a \standard completeness" for the logic SFP(L ; L). In particular we will show that, upon restricting our language to a special, yet sufficiently expressive subset of well-formed formulas, the logic SFP(L ; L) turns out to be sound and complete with respect to a prominent subclass of SMV-algebras which can be reasonably called \standard". Indeed, these standard SMV-algebras are grounded on the same MV-algebra of continuous real-valued functions and their internal states are obtained by integrating the continuous functions which correspond toLukasiewicz events by a regular, Borel (and hence σ-additive) probability measure. Although our main result only offers a partial solution to the problem of establishing standard completeness for SFP(L ; L), the idea behind its proof is promising and it suggests ways to tackle the general problem. Indeed, the class of formulas to which we will restrict our attention, called purely probabilistic formulas, form the ground probabilistic language upon which the all formulas of SFP(L ; L)are inductively defined. This paper is organizes as follows: in the next section we will recall some basic definitions and needed results aboutLukasiewicz logic and MV-algebras. Section 3 is dedicated to a brief introduction to generalized probability theory onLukasiewicz logic, i.e., state theory, while in Section 4 we will focus on SMV- algebras and the probabilistic logic SFP(L ; L). In Section 5 we will prove the main results of this paper and in particular that a purely probabilistic formula φ is a theorem of SFP(L ; L)iff φ holds in all standard SMV-algebras. 2Lukasiewicz logic and MV-algebras The language of the infinite-valuedLukasiewicz calculusLis made of a countable set of propositional variables fq1; q2;:::g, the binary connective ⊕, the unary connective : and the constant ?. Formulas are defined by the usual inductive rules. Further useful connectives are definable as follows: > = :?; ' = :(:' ⊕ : ); ' ! = :' ⊕ ; ' ^ = ' (' ! ); ' _ = :(:' ^ : ); ' = :(' ! ); d('; ) = (' ! ) ⊕ ( ! '). We invite the reader to consult [8, 2] for an axiomatization ofLukasiewicz logic. For the sake of the present paper it is important to recall that this calculus has an equivalent algebraic semantics: the variety MV of MV-algebras. These are structures of the form A = (A; ⊕; :; ?) (the same language ofLukasiewicz logic), where (A; ⊕; ?) is a commutative monoid and, defining further operations as above, the following equations hold: x ⊕ > = > (x ! y) ! y = (y ! x) ! x. The algebraizability ofLukasiewicz logic with respect to MV implies thatLis sound and complete w.r.t. the class of MV-algebras. This means the following: for every MV-algebra A, define an A-valuation as a map v from the propositional variables qi's to A which extends to all formulas by truth functionality; then, a formula ' is a theorem ofLukasiewicz logic iff for every MV-algebra A and every A-valuation v, v(') = >. Furthermore, every formula ' on propositional variables q1; : : : ; qk can be regarded, on the algebraic side, as a term t(x1; : : : ; xk) on the same number of variables. For every MV-algebra A and for every term t, we denote by tA the interpretation (or semantics) of t in A. In every MV-algebra the relation x ≤ y iff x ! y = > determines a lattice- order which coincides with the one given by the operations ^ and _. If in A the order ≤ is linear, we will say that A is an MV-chain. The following collects two typical examples of MV-algebras which will play a central role in this paper. Example 1. (1) The standard MV-algebra [0; 1]MV has support on the real unit interval [0; 1] and for all x; y 2 [0; 1], x ⊕ y = minf1; x + yg, :x = 1 − x and ? = 0. The semantics, in [0; 1]MV , of theLukasiewicz connectives we defined above is as follows: > = 1; x y = maxf0; x + y − 1g; x ! y = minf1; 1 − x + yg; x ^ y = minfx; yg; x _ y = maxfx; yg; x y = maxf0; x − yg; d(x; y) = jx − yj (the usual Euclidean distance). Chang's theorem [1] shows that MV is generated by [0; 1]MV , whenceLukasie- wicz logic is complete w.r.t. to [0; 1]MV . (2) For every k 2 !, let F(k) be the set of functions f : [0; 1]k ! [0; 1] which are continuous, piecewise linear and such that each piece has integer coefficient, i.e., the set of k-variable McNaughton functions [2]. The point-by-point applica- tion of the operations of [0; 1]MV makes F(k) an MV-algebra which coincides, up to isomorphism, with the free MV-algebra over k-variables. For every formula ofLukasiewicz language, we will denote by f its corresponding McNaughton function. The free MV-algebra over infinitely-many generators will be henceforth denoted by F(!). Let A and B be two MV-algebras. An MV-homomorphism is a function h : A ! B such that, adopting without danger of confusion the same symbols for the operations of both algebras: (1) h(?) = ?; (2) h(x⊕y) = h(x)⊕h(y); (3) h(:x) = :h(x). If S is a subset of A, a map h : S ! B is a partial homomorphism provided that the above conditions (1-3) holds for the elements of S. Injective (partial) homomorphisms are called (partial) embeddings. (Partial) embeddings of A to B will be denoted by A ,! B (A ,!p B, respectively). Let A be an MV-algebra and let S be a subset of A. We denote hSiA the MV- subalgebra of A generated by S. In particular, if S is finite, for every b 2 hSiA, A there are a1; : : : ; an 2 S and an n-ary term t such that b = t (a1; : : : ; an). Lemma 1. (1) For every MV-chain A and for every finite subset S of A, there p exists a partial embedding hS : S,! [0; 1]MV . (2) Let A; B be MV-algebras, let S be a finite subset of A. Every partial homo- ^ morphism hS : S ⊆ A ! B extends to a homomorphisms hS : hSiA ! B. Proof. (1) Immediately follows from Gurevich-Kokorin theorem (see for instance [8, Theorem 1.6.17]). (2) For every element b 2 hSiA, there is an term t and a1; : : : ; an 2 S such that A ^ b = t (a1; : : : ; an). Define hS : hSiA ! B as follows: ^ ^ A B h(b) = h(t (a1; : : : ; an)) = t (h(a1); : : : ; h(an)): It is easy to see that h^ commutes with the operations of A and B, whence it is an MV-homomorphism. ut An ideal of an MV-algebra A is a subset I of A such that: (1) ? 2 I; (2) if a 2 I and b 2 I, then a ⊕ b 2 I; (3) if a 2 I and b ≤ a, then b 2 I. Every ideal I of A determines a congruence ΘI of A: (a; b) 2 ΘI iff d(a; b) 2 I. For every MV-algebra A and every ideal I of A, we denote by A=I the quotient of A by the congruence ΘI .
Load more

Recommended publications
  • Tarski's Threat to the T-Schema
    Tarski’s Threat to the T-Schema MSc Thesis (Afstudeerscriptie) written by Cian Chartier (born November 10th, 1986 in Montr´eal, Canada) under the supervision of Prof. dr. Frank Veltman, and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: August 30, 2011 Prof. Dr. Frank Veltman Prof. Dr. Michiel van Lambalgen Prof. Dr. Benedikt L¨owe Dr. Robert van Rooij Abstract This thesis examines truth theories. First, four relevant programs in philos- ophy are considered. Second, four truth theories are compared according to a range of criteria. The truth theories are categorised according to Leitgeb’s eight criteria for a truth theory. The four truth theories are then compared with each-other based on three new criteria. In this way their relative use- fulness in pursuing some of the aims of the four programs is evaluated. This presents a springboard for future work on truth: proposing ideas for differ- ent truth theories that advance unambiguously different programs on the basis of the four truth theories proposed. 1 Acknowledgements I first thank my supervisor Prof. Dr. Frank Veltman for regularly read- ing and providing constructive feedback, recommending some papers along the way. This thesis has been much improved by his corrections and input, including extensive discussions and suggestions of the ideas proposed here. His patience in working with me on the thesis has been much appreciated. Among the other professors in the ILLC, Dr. Robert van Rooij also provided helpful discussion.
    [Show full text]
  • First-Order Logic
    Chapter 10 First-Order Logic 10.1 Overview First-Order Logic is the calculus one usually has in mind when using the word ‘‘logic’’. It is expressive enough for all of mathematics, except for those concepts that rely on a notion of construction or computation. However, dealing with more advanced concepts is often somewhat awkward and researchers often design specialized logics for that reason. Our account of first-order logic will be similar to the one of propositional logic. We will present ² The syntax, or the formal language of first-order logic, that is symbols, formulas, sub-formulas, formation trees, substitution, etc. ² The semantics of first-order logic ² Proof systems for first-order logic, such as the axioms, rules, and proof strategies of the first-order tableau method and refinement logic ² The meta-mathematics of first-order logic, which established the relation between the semantics and a proof system In many ways, the account of first-order logic is a straightforward extension of propositional logic. One must, however, be aware that there are subtle differences. 10.2 Syntax The syntax of first-order logic is essentially an extension of propositional logic by quantification 8 and 9. Propositional variables are replaced by n-ary predicate symbols (P , Q, R) which may be instantiated with either variables (x, y, z, ...) or parameters (a, b, ...). Here is a summary of the most important concepts. 101 102 CHAPTER 10. FIRST-ORDER LOGIC (1) Atomic formulas are expressions of the form P c1::cn where P is an n-ary predicate symbol and the ci are variables or parameters.
    [Show full text]
  • A Subsystem of Classical Propositional Logic
    VALUATIONS FOR DIRECT PROPOSITIONAL LOGIC In (1969) a subsystem of classical propositional logic - called direct logic since all indirect inferences are excluded from it - was formulated as a generalized sequential calculus. With its rules the truth-value (true (t) or false (0) of the consequent can be determined from the truth-values of the premisses. In this way the semantical stipulations are formulated construc• tively as in a calculus of natural deduction, i.e. semantics itself is a formal system of rules. The rules for propositional composita define an extension of basic calculi containing only truth rules for atomic sentences. The sen• tences provable in the extensions of all basic calculi, i.e. in the proposi• tional calculus itself, are the logically true sentences. The principle of bi- valence is not presupposed for the basic calculi. That it holds for a specific calculus - and then also in its propositional extension - is rather a theorem to be proved by metatheoretic means. In this approach a semantics in the usual sense, i.e. a semantics based on a concept of valuation, has no place since the calculus of direct logic itself is already conceived of as a system of semantical rules. Nevertheless it is of some interest to see that there is an adequate and intuitively plau• sible valuation-semantics for this calculus. The language L used in what follows is the usual language of proposi• tional logic with —i, A and n> as basic operators.1 A classical or total valuation of L is a function V mapping the set of all sentences of L into {t, f} so that K(-i A) = t iff V(A) = f, V(A A B) = t iff V(A) = V(B) = t.
    [Show full text]
  • Statistical Parsing and Unambiguous Word Representation in Opencog’S Unsupervised Language Learning Project
    Statistical parsing and unambiguous word representation in OpenCog’s Unsupervised Language Learning project Master’s thesis in MPALG and MPCAS CLAUDIA CASTILLO DOMENECH and ANDRES SUAREZ MADRIGAL Department of Computer Science and Engineering CHALMERS UNIVERSITY OF TECHNOLOGY UNIVERSITY OF GOTHENBURG Gothenburg, Sweden 2018 Master’s thesis 2018 Statistical parsing and unambiguous word representation in OpenCog’s Unsupervised Language Learning project CLAUDIA CASTILLO DOMENECH ANDRES SUAREZ MADRIGAL Department of Computer Science and Engineering Chalmers University of Technology University of Gothenburg Gothenburg, Sweden 2018 Statistical parsing and unambiguous word representation in OpenCog’s Unsupervised Language Learning project CLAUDIA CASTILLO DOMENECH ANDRES SUAREZ MADRIGAL « CLAUDIA CASTILLO DOMENECH and ANDRES SUAREZ MADRIGAL, 2018. Supervisor: Luis Nieto Piña, Faculty of Humanities Advisor: Ben Goertzel, Hanson Robotics Ltd. Examiner: Morteza Haghir Chehreghani, Data Science division Master’s Thesis 2018 Department of Computer Science and Engineering Chalmers University of Technology and University of Gothenburg SE-412 96 Gothenburg Telephone +46 31 772 1000 Typeset in LATEX Gothenburg, Sweden 2018 iv Statistical parsing and unambiguous word representation in OpenCog’s Unsupervised Language Learning project CLAUDIA CASTILLO DOMENECH and ANDRES SUAREZ MADRIGAL Department of Computer Science and Engineering Chalmers University of Technology and University of Gothenburg Abstract The work presented in the current thesis is an effort
    [Show full text]
  • 14 the Semantics of Classical First- Order Logic
    The Semantics of Classical First- 14 Order Logic 1. Introduction...........................................................................................................................2 2. Semantic Evaluations............................................................................................................2 3. Semantic Items and their Categories.....................................................................................2 4. Official versus Conventional Identifications of Semantic Items ...........................................3 5. The Categorial Correspondence Rule...................................................................................3 6. The Categorial Composition Principle .................................................................................5 7. The Sub-Functions of a Semantic Evaluation........................................................................6 8. Interpretations.......................................................................................................................6 9. Truth and Falsity for Simple Atomic Formulas.....................................................................7 10. Pronouns – Variables and Constants.....................................................................................9 11. Multiple Pronouns ..............................................................................................................10 12. Assignment Functions – Constants ......................................................................................12
    [Show full text]
  • Propositional Logic
    Propositional Logic Andreas Klappenecker Propositions A proposition is a declarative sentence that is either true or false (but not both). Examples: • College Station is the capital of the USA. • There are fewer politicians in College Station than in Washington, D.C. • 1+1=2 • 2+2=5 Propositional Variables A variable that represents propositions is called a propositional variable. For example: p, q, r, ... [Propositional variables in logic play the same role as numerical variables in arithmetic.] Propositional Logic The area of logic that deals with propositions is called propositional logic. In addition to propositional variables, we have logical connectives such as not, and, or, conditional, and biconditional. Syntax of Propositional Logic Approach We are going to present the propositional logic as a formal language: - we first present the syntax of the language - then the semantics of the language. [Incidentally, this is the same approach that is used when defining a new programming language. Formal languages are used in other contexts as well.] Formal Languages Let S be an alphabet. We denote by S* the set of all strings over S, including the empty string. A formal language L over the alphabet S is a subset of S*. Syntax of Propositional Logic Our goal is to study the language Prop of propositional logic. This is a language over the alphabet ∑=S ∪ X ∪ B , where - S = { a, a0, a1,..., b, b0, b1,... } is the set of symbols, - X = {¬,∧,∨,⊕,→,↔} is the set of logical connectives, - B = { ( , ) } is the set of parentheses. We describe the language Prop using a grammar. Grammar of Prop ⟨formula ⟩::= ¬ ⟨formula ⟩ | (⟨formula ⟩ ∧ ⟨formula ⟩) | (⟨formula ⟩ ∨ ⟨formula ⟩) | (⟨formula ⟩ ⊕ ⟨formula ⟩) | (⟨formula ⟩ → ⟨formula ⟩) | (⟨formula ⟩ ↔ ⟨formula ⟩) | ⟨symbol ⟩ Example Using this grammar, you can infer that ((a ⊕ b) ∨ c) ((a → b) ↔ (¬a ∨ b)) both belong to the language Prop, but ((a → b) ∨ c does not, as the closing parenthesis is missing.
    [Show full text]
  • Propositional Logic
    Propositional Logic LX 502 - Semantics September 19, 2008 1. Semantics and Propositions Natural language is used to communicate information about the world, typically between a speaker and an addressee. This information is conveyed using linguistic expressions. What makes natural language a suitable tool for communication is that linguistic expressions are not just grammatical forms: they also have content. Competent speakers of a language know the forms and the contents of that language, and how the two are systematically related. In other words, you can know the forms of a language but you are not a competent speaker unless you can systematically associate each form with its appropriate content. Syntax, phonology, and morphology are concerned with the form of linguistic expressions. In particular, Syntax is the study of the grammatical arrangement of words—the form of phrases but not their content. From Chomsky we get the sentence in (1), which is grammatical but meaningless. (1) Colorless green ideas sleep furiously Semantics is the study of the content of linguistic expressions. It is defined as the study of the meaning expressed by elements in a language and combinations thereof. Elements that contribute to the content of a linguistic expression can be syntactic (e.g., verbs, nouns, adjectives), morphological (e.g., tense, number, person), and phonological (e.g., intonation, focus). We’re going to restrict our attention to the syntactic elements for now. So for us, semantics will be the study of the meaning expressed by words and combinations thereof. Our goals are listed in (2). (2) i. To determine the conditions under which a sentence is true of the world (and those under which it is false) ii.
    [Show full text]
  • Mathematical Logic
    Mathematical logic Jouko Väänänen January 16, 2017 ii Contents 1 Introduction 1 2 Propositional logic 3 2.1 Propositional formulas . .3 2.2 Turth-tables . .7 2.3 Problems . 12 3 Structures 15 3.1 Relations . 15 3.2 Structures . 16 3.3 Vocabulary . 19 3.4 Isomorphism . 20 3.5 Problems . 22 4 Predicate logic 23 4.1 Formulas . 30 4.2 Identity . 36 4.3 Deduction . 37 4.4 Theories . 43 4.5 Problems . 51 5 Incompleteness of number theory 55 5.1 Primitive recursive functions . 57 5.2 Recursive functions . 65 5.3 Definability in number theory . 67 5.4 Recursively enumerable sets . 73 5.5 Problems . 79 6 Further reading 83 iii iv CONTENTS Preface This book is based on lectures the author has given in the Department of Math- ematics and Statistics in the University of Helsinki during several decades. As the title reveals, this is a mathematics course, but it can also serve computer science students. The presentation is self-contained, although the reader is as- sumed to be familiar with elementary set-theoretical notation and with proof by induction. The idea is to give basic completeness and incompleteness results in an unaf- fected straightforward way without delving into all the elaboration that modern mathematical logic involves. There is a section “Further reading” guiding the reader to the rich literature on more advanced results. I am indebted to the many students who have followed the course as well as to the teachers who have taught it in addition to myself, in particular Tapani Hyttinen, Åsa Hirvonen and Taneli Huuskonen.
    [Show full text]
  • Singularitynet: a Decentralized, Open Market and Inter-Network for Ais
    SingularityNET: A decentralized, open market and inter-network for AIs December 19, 2017 Abstract The value and power of Artificial Intelligence is growing dramatically every year, and will soon dominate the internet – and the economy as a whole. However, AI tools today are fragmented by a closed development environment; most are developed by one company to perform one task, and there is no way to plug two tools together. SingularityNET aims to become the key protocol for networking AI and machine learning tools to form a coordinated Artificial General Intelligence. SingularityNET is an open-source protocol and collection of smart contracts for a decentralized market of coordinated AI services. Within this framework, the benefits of AI become a global commons infrastructure for the benefit of all; anyone can access AI tech or become a stakeholder in its development. Anyone can add an AI/machine learning service to SingularityNET for use by the network, and receive network payment tokens in exchange. SingularityNET is backed by the SingularityNET Foundation, which operates on a belief that the benefits of AI should not be dominated by any small set of powerful institutions, but shared by all. A key goal of SingularityNET is to ensure the technology is benevolent according to human standards, and the network is designed to incentivize and reward beneficial players. 1 Contents 1 Vision 4 1.1 Inspiration . 4 1.2 Acute Market Needs Addressed . 5 1.3 A Robust and Adaptive Software Architecture . 6 1.4 A Decentralized, Self-Organizing Cooperative . 6 1.5 The SingularityNET Foundation . 8 2 Services and Market Overview 9 3 How SingularityNET Works 11 3.1 Network Dynamics .
    [Show full text]
  • Vagueness in a Precise World: Essays on Metaphysical Vagueness
    Vagueness in a Precise World: Essays on Metaphysical Vagueness by Rohan Sud A dissertation submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy (Philosophy) in The University of Michigan 20:6 Doctoral Committee: Professor Brian J. Weatherson, Co-Chair Associate Professor David Manley, Co-Chair Associate Professor Ezra R. Keshet Professor Theodore Sider, Rutgers University Associate Professor Eric P. Swanson © Rohan Sud | 20:6 | All Rights Reserved To my sisters, Anisha and Anjali Sud ii Acknowledgements First and foremost, I would like to thank my committee. I first became inter- ested in vagueness while taking a fascinating seminar with Eric Swanson. I’m extremely grateful for the helpful advice he has given me during my time at Michigan, on the content of my dissertation and beyond. Early in graduate school, while I was still familiarizing myself with the landscape of the disci- pline’s subfields, I was exposed to Ted Sider’s work. That work initiated my decision to specialize in metaphysics: his writing is a constant source of philo- sophical inspiration for me and a model for my own research. I’ve probably spent more time talking philosophy with David Manley than any other profes- sor and I feel very fortunate to have had that much exposure to such an insight- ful thinker. The enjoyment he takes in doing philosophy is contagious: talking philosophy with him is relaxed and fun – and always illuminating. Finally, I couldn’t have asked for a more conscientious adviser than Brian Weatherson. He constantly encouraged me to pursue my boldest ideas and come to grips with the underlying philosophical issues buried deep in my arguments.
    [Show full text]
  • Formal Semantics and Logic.Pdf
    Formal Semantics and Logic Bas C. van Fraassen Copyright c 1971, Bas C. van Fraassen Originally published by The Macmillan Company, New York This eBook was published by Nousoul Digital Publishers. Its formatting is optimized for eReaders and other electronic reading devices. For information, the publisher may be con- tacted by email at: [email protected] 2 To my parents 3 Preface to the .PDF Edition With a view to the increasing academic importance of digital media this electronic edition was created by Nousoul Digital Publishers. Thanks to the diligent work and expertise of Brandon P. Hopkins this edition has fea- tures that no book could have in the year of its original publication: searchable text and hyperlinked notes. The text itself remains essentially unchanged, but in addition to typographical corrections there are also some substantive corrections. Apart from the change in the solution to exercise 5.4 of Chapter 3, none comprise more than a few words or symbols. However, as different as digital media are from print media, so too is digital for- matting different from print formatting. Thus there are significant formatting differences from the earlier edition. The font and page dimensions differ, as well as the page numbering, which is made to accord with the pagina- tion automatically assigned to multi-paged documents by most standard document-readers. Bas van Fraassen 2016 4 Contents Preface (1971)9 Introduction: Aim and Structure of Logical Theory 12 1 Mathematical Preliminaries 19 1.1 Intuitive Logic and Set Theory....... 19 1.2 Mathematical Structures.......... 23 1.3 Partial Order and Trees.........
    [Show full text]
  • A Friendly Introduction to Mathematical Logic Christopher C
    SUNY Geneseo KnightScholar Geneseo Authors Milne Library Publishing 1-1-2015 A Friendly Introduction to Mathematical Logic Christopher C. Leary SUNY Geneseo Lars Kristiansen Follow this and additional works at: https://knightscholar.geneseo.edu/geneseo-authors This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 4.0 License. Recommended Citation Leary, Christopher C. and Kristiansen, Lars, "A Friendly Introduction to Mathematical Logic" (2015). Geneseo Authors. 6. https://knightscholar.geneseo.edu/geneseo-authors/6 This Book is brought to you for free and open access by the Milne Library Publishing at KnightScholar. It has been accepted for inclusion in Geneseo Authors by an authorized administrator of KnightScholar. For more information, please contact [email protected]. oduc Intr tio y n dl to n ie r F A Mathematical Logic 2nd Edition Christopher C. Leary Lars Kristiansen A Friendly Introduction to Mathematical Logic A Friendly Introduction to Mathematical Logic 2nd Edition Second printing With corrections and some renumbered exercises Christopher C. Leary State University of New York College at Geneseo Lars Kristiansen The University of Oslo Milne Library, SUNY Geneseo, Geneseo, NY c 2015 Christopher C. Leary and Lars Kristiansen ISBN: 978-1-942341-07-9 Milne Library SUNY Geneseo One College Circle Geneseo, NY 14454 Lars Kristiansen has received financial support from the Norwegian Non-fiction Literature Fund Contents Preface ix 1 Structures and Languages 1 1.1 Na¨ıvely . .3 1.2 Languages . .5 1.3 Terms and Formulas . .9 1.4 Induction . 13 1.5 Sentences . 19 1.6 Structures . 22 1.7 Truth in a Structure .
    [Show full text]