Subminimal Logics and Relativistic Negation
|
|
- Clement Matthew Booker
- 5 years ago
- Views:
Transcription
1 School of Information Science, JAIST March 2, 2018
2 Outline 1 Background Minimal Logic Subminimal Logics 2 Some More 3
3 Minimal Logic Subminimal Logics Outline 1 Background Minimal Logic Subminimal Logics 2 Some More 3
4 Minimal Logic Subminimal Logics Languages Definition (L +, L, L ) We shall use the following propositional languages: L + ::= p A B A B A B L ::= p A B A B A B L ::= p A B A B A B A In L, we take A to be the abbreviation for A.
5 Minimal Logic Subminimal Logics Minimal/Intuitionistic Logic Definition (MPC, IPC ) MPC is the smallest set of formulas of L containing the axioms below. Plus: If A, A B MPC then B MPC (MP). Axioms A (B A); (A (B C)) ((A B) (A C)); A (A B); B (A B); (A C) ((B C) (A B C)); A B A; A B B; A (B (A B)). IPC in addition contains the axiom EFQ: A. in MPC behaves like a propositional variable.
6 Minimal Logic Subminimal Logics Negation and Contradiction Definition (MPC ) MPC is the smallest set of formulas of L containing the axioms below. Plus: If A, A B MPC then B MPC. Axioms A (B A); (A (B C)) ((A B) (A C)); A (A B); B (A B); (A C) ((B C) (A B C)); A B A; A B B; A (B (A B)); M: [(A B) (A B)] A Call the negation-less(l + ) fragment of MPC as PPC.
7 Minimal Logic Subminimal Logics Counter-intuitive Inferences Involving Negation Definition (EFQ, NeF) EFQ: (A A) B [for MPC ] NeF: (A A) B EFQ: holds in intuitionistic logic. NeF: holds in minimal and intuitionistic logic. They are seen as unsatisfactory from the criteria of: (Relevance) Premises and the conclusions are related. (Paraconsistency) Contradictions do not trivialise the logic.
8 Minimal Logic Subminimal Logics Paths to Subminimality This motivates the study of logics with a weaker negation. We can weaken MPC or MPC. MPC : no axiom for difficult to weaken MPC : has the axiom M amendable with weaker negation axioms Such axioms are called subminimal axioms, and the logics with them (defined over PPC) subminimal logics.
9 Minimal Logic Subminimal Logics Outline 1 Background Minimal Logic Subminimal Logics 2 Some More 3
10 Minimal Logic Subminimal Logics Known Subminimal Axioms Definition (Co, An, NeF, N) Colacito, de Jongh and Vargas (2017) studied the following subminimal axioms. Co: (A B) ( B A); An: (A A) A; NeF: (A A) B; N: (A B) ( A B); Proposition (Colacito (2016), Colacito et al.(2017)) (i) Co NeF, Co N (ii) An+N M (iii) Co A A Call PPC+N (Co) as NPC (CoPC); NPC+NeF as NeFPC. NPC is taken as the basic subminimal logic.
11 Minimal Logic Subminimal Logics Graphical Representation Logic Negation Axiom(s) MPC N + An: (A A) A CoPC Co: (A B) ( B A) NeFPC N + NeF: (A A) B NPC N: (A B) ( A B) Question Is there a logic between MPC and CoPC?
12 Outline Background Some More 1 Background Minimal Logic Subminimal Logics 2 Some More 3
13 An : A Weaker Version of An Some More Definition (An ) An : (A A) ( B A) We define An PC as NPC + An. Proposition (separating An PC from CoPC [N.]) (i) An PC Co; CoPC An. (ii) An PC CoPC. Hence CoPC is not maximal. Proposition (some properties of An PC [N.]) An PC A A; An PC A A.
14 Sequent Calculus for An PC Some More Definition (Sequent Calculus GAn for An PC) Axioms: Ax: p p (R : Γ ) Rules for positive connectives: Γ, A, B C Γ A Γ B L : R : Γ, A B C Γ A B Γ, A C Γ, B C Γ A i L : R : (i {1, 2}) Γ, A B C Γ A 1 A 2 Γ, A B A Γ, B C Γ, A B L : R : Γ, A B C Γ A B Rules for negation: Γ, A, A B Γ, A, B A N: Γ, A B An : Γ, B, A A Γ, B A
15 Some More Cut and Equivalence with Hilbert-system We will in addition consider the following rule. Definition (Cut) Γ A Γ, A B Cut: Γ, Γ B It is straightforward to establish the following equivalence: Proposition (equivalence with An PC [N.]) Γ An A if and only if GAn +Cut Γ A
16 A Characterisation of An PC Some More Definition (classes F + /F ) F + ::= p P 1 P 2 P A A P A P N A F ::= A N A A N N 1 N 2 P N (P F +, N F, A F + F ) Proposition (separating An PC from MPC [N.]) (i) If GAn +Cut Γ A and A F, then Γ has a formula in F. (ii) GAn +Cut A for any A; hence MPC An PC. To see the last part, recall e.g. M (p p). Negation in An PC is relativistic, in the sense of (ii).
17 Graphical Representation Some More Logic Negation Axiom(s) MPC N + An: (A A) A An PC CoPC N + An : (A A) ( B A) Co: (A B) ( B A) NeFPC N + NeF: (A A) B NPC N: (A B) ( A B) -All subminimal extensions of An PC have relativistic negation.
18 Some More Further Proof-theoretic Properties of An PC Cut turns out to be admissible in GAn : Proposition (N.) (i) If GAn +Cut Γ A then GAn Γ A (ii) An PC is decidable. As further consequences of cut-admissibility, We can show the disjunction property of An PC; The interpolation theorem holds for An PC, extending the result of Colacito (2016) on NPC.
19 Outline Background Some More 1 Background Minimal Logic Subminimal Logics 2 Some More 3
20 MPC and Kripke Semantics Some More Definition (Kripke semantics for MPC ) A minimal frame is a triple (W,, F). (W, ) is a poset. F W is an upward closed set; i.e. w F and w w implies w F. We have the following valuation of negation. - M, w A w w[m, w A w F] F denotes the set of worlds where all negations hold.
21 An PC and Kripke Semantics Some More Definition (Kripke semantics for An PC) An An -frame is a quadruple (W,, F, G). (W, ) is a poset. F, G W are upward closed subsets s.t. F G; We have the following valuation of negation. - M, w A w w[m, w A w F] w G G denotes the set of worlds where some negations hold. Thus G is a natural counterpart of F. G\F is the area where negations hold untrivially.
22 Completeness of An PC Some More The following properties hold with repect to the semantics. Proposition (completeness of An PC [N.]) Γ An A Γ An A Proposition (finite model property for An PC [N.]) An PC is weakly complete with respect to the class of finite An -frames.
23 Outline Background Some More 1 Background Minimal Logic Subminimal Logics 2 Some More 3
24 Axiom LP Background Some More Q. Is there a logic between MPC and An PC? Definition (LP) LP: (A A) A LP can be seen as expressing the liar s paradox. Proposition (class of LP-frames [N.]) Let F be an An -frame. Then: F LP w W [w G w w(w G\F)] The frame property says you will eventually arrive in G. If we take G =, then LP is not valid in the frame. Thus by soundness, LP is not a theorem of An PC.
25 LPPC Background Some More Definition (LPPC) We define LPPC := An PC + LP By the previous proposition, LPPC An PC. Proposition (N.) LPPC is sound and complete with the class of LP-frames. Any LP-frame with G W can refute An; so MPC LPPC. LPPC satisfies the disjunction property and the finite model property.
26 Graphical Representation Some More Logic Negation Axiom(s) MPC N + An: (A A) A LPPC N + An + LP: (A A) A An PC CoPC N + An : (A A) ( B A) Co: (A B) ( B A) NeFPC N + NeF: (A A) B NPC N: (A B) ( A B)
27 Outline Background Some More 1 Background Minimal Logic Subminimal Logics 2 Some More 3
28 Some More Countably Many Formulas below set the maximal length of intuitionistic frames. Proposition (a result from intermediate logics) Let bd 1 := p 1 p 1, bd n+1 := p n+1 (p n+1 bd n ). Then F I bd i W does not have chains of > i worlds. We can apply this to the length of chains in W \G in LP-frame. Proposition (N.) Let Gd 1 := (p 1 p 1 ) p 1, Gd n+1 := p n+1 (p n+1 Gd n ). Then F LP Gd i W \G does not have chains of i worlds. With this it is easy to verify (via soundness), MPC = LPPC + Gd 1 LPPC + Gd 2... LPPC.
29 Future Directions Background Is there a maximal subminimal logic with relativistic negation? How many logics are there between MPC and An PC? (Bezhanishvili, Colacito and de Jongh (2017) showed uncountably many exist between MPC and NPC.) How does our semantics correspond with the Kripke semantics of Colacito et al.(2017)?
30 Reference N. Bezhanishvili, A. Colacito and D. de Jongh (2017). A lattice of subminimal logics of negation. TbiLLC 2017: Twelfth International Tbilisi Symposium on Language, Logic and Computation. A. Colacito (2016). Minimal and Subminimal Logic of Negation. Master s Thesis. University of Amsterdam. A. Colacito, D. de Jongh and A.L. Vargas (2017). Subminimal negation. Soft Computing 21:
31 Reference J. van Benthem (1984). Correspondence Theory. in D. Gabbay and F. Guenthner (eds.), Handbook of Philosophical Logic, Volume II: Extensions of Classical Logic. Kluwer Academic Publishers. A. Chagrov and M. Zakharyaschev (1997). Modal Logic. Oxford University Press. D. van Dalen (2013). Logic and Structure. Fifth edition. Springer.
32 Reference K. Sano, T. Kurahashi, T. Usuba, H. Kurokawa and M. Kikuchi (2016). Proof and Truth in Mathematics: Modal Logic and the Foundation of Mathematics (in Japanese). Kyoritsu Shuppan. A.S. Troelstra and H. Schwichtenberg (2000). Basic Proof Theory. Second edition. Cambridge University Press. A.S. Troelstra and D. van Dalen (1988). Constructivism in Mathematics: An Introduction. Volume I, Elsevier.
MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC
Bulletin of the Section of Logic Volume 45:3/4 (2016), pp. 143 153 http://dx.doi.org/10.18778/0138-0680.45.3.4.01 Anna Glenszczyk MONADIC FRAGMENTS OF INTUITIONISTIC CONTROL LOGIC Abstract We investigate
More informationSubminimal Negation. Almudena Colacito, Dick de Jongh and Ana Lucia Vargas. March 30, 2016
Subminimal Negation Almudena Colacito, Dick de Jongh and Ana Lucia Vargas March 30, 2016 Abstract Minimal Logic, i.e. intuitionistic logic without the ex falso principle, is investigated in its original
More informationA Study of Subminimal Logics of Negation and their Modal Companions
A Study of Subminimal Logics of Negation and their Modal Companions Nick Bezhanishvili 1, Almudena Colacito 2, and Dick de Jongh 1 1 Institute for Logic, Language and Computation University of Amsterdam,
More informationSemantics of intuitionistic propositional logic
Semantics of intuitionistic propositional logic Erik Palmgren Department of Mathematics, Uppsala University Lecture Notes for Applied Logic, Fall 2009 1 Introduction Intuitionistic logic is a weakening
More informationPROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS
PROPOSITIONAL MIXED LOGIC: ITS SYNTAX AND SEMANTICS Karim NOUR 1 and Abir NOUR 2 Abstract In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic
More informationDe Jongh s characterization of intuitionistic propositional calculus
De Jongh s characterization of intuitionistic propositional calculus Nick Bezhanishvili Abstract In his PhD thesis [10] Dick de Jongh proved a syntactic characterization of intuitionistic propositional
More information5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci
5-valued Non-deterministic Semantics for The Basic Paraconsistent Logic mci Arnon Avron School of Computer Science, Tel-Aviv University http://www.math.tau.ac.il/ aa/ March 7, 2008 Abstract One of the
More informationUvA-DARE (Digital Academic Repository) Subminimal negation Colacito, A.; de Jongh, D.H.J.; Vargas Sandoval, A.L. Published in: Soft Computing
UvA-DARE (Digital Academic Repository) Subminimal negation Colacito, A.; de Jongh, D.H.J.; Vargas Sandoval, A.L. Published in: Soft Computing DOI: 10.1007/s00500-016-2391-8 Link to publication Citation
More informationHypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models Agata Ciabattoni Mauro Ferrari Abstract In this paper we define cut-free hypersequent calculi for some intermediate logics semantically
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More informationOn Jankov-de Jongh formulas
On Jankov-de Jongh formulas Nick Bezhanishvili Institute for Logic, Language and Computation University of Amsterdam http://www.phil.uu.nl/~bezhanishvili The Heyting day dedicated to Dick de Jongh and
More informationMinimal and Subminimal Logic of Negation
Minimal and Subminimal Logic of Negation MSc Thesis (Afstudeerscriptie) written by Almudena Colacito (born November 29 th, 1992 in Fabriano, Italy) under the supervision of Dr. Marta Bílková, Prof. Dr.
More informationFrom Frame Properties to Hypersequent Rules in Modal Logics
From Frame Properties to Hypersequent Rules in Modal Logics Ori Lahav School of Computer Science Tel Aviv University Tel Aviv, Israel Email: orilahav@post.tau.ac.il Abstract We provide a general method
More informationPropositional Dynamic Logic
Propositional Dynamic Logic Contents 1 Introduction 1 2 Syntax and Semantics 2 2.1 Syntax................................. 2 2.2 Semantics............................... 2 3 Hilbert-style axiom system
More informationKripke Semantics for Basic Sequent Systems
Kripke Semantics for Basic Sequent Systems Arnon Avron and Ori Lahav School of Computer Science, Tel Aviv University, Israel {aa,orilahav}@post.tau.ac.il Abstract. We present a general method for providing
More informationCHAPTER 11. Introduction to Intuitionistic Logic
CHAPTER 11 Introduction to Intuitionistic Logic Intuitionistic logic has developed as a result of certain philosophical views on the foundation of mathematics, known as intuitionism. Intuitionism was originated
More informationAutomated Support for the Investigation of Paraconsistent and Other Logics
Automated Support for the Investigation of Paraconsistent and Other Logics Agata Ciabattoni 1, Ori Lahav 2, Lara Spendier 1, and Anna Zamansky 1 1 Vienna University of Technology 2 Tel Aviv University
More informationTR : Binding Modalities
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2012 TR-2012011: Binding Modalities Sergei N. Artemov Tatiana Yavorskaya (Sidon) Follow this and
More informationFrom Syllogism to Common Sense
From Syllogism to Common Sense Mehul Bhatt Oliver Kutz Thomas Schneider Department of Computer Science & Research Center on Spatial Cognition (SFB/TR 8) University of Bremen Normal Modal Logic K r i p
More informationTwo sources of explosion
Two sources of explosion Eric Kao Computer Science Department Stanford University Stanford, CA 94305 United States of America Abstract. In pursuit of enhancing the deductive power of Direct Logic while
More informationDisplay calculi in non-classical logics
Display calculi in non-classical logics Revantha Ramanayake Vienna University of Technology (TU Wien) Prague seminar of substructural logics March 28 29, 2014 Revantha Ramanayake (TU Wien) Display calculi
More informationStable formulas in intuitionistic logic
Stable formulas in intuitionistic logic Nick Bezhanishvili and Dick de Jongh August 14, 2014 Abstract NNIL-formulas are propositional formulas that do not allow nesting of implication to the left. These
More informationRules of Inference. Lecture 2 Wednesday, September 25. Rosalie Iemhoff Utrecht University, The Netherlands
Rules of Inference Lecture 2 Wednesday, September 25 Rosalie Iemhoff Utrecht University, The Netherlands TbiLLC 2013 Gudauri, Georgia, September 23-27, 2013 1 / 26 Today Examples Bases Approximations Projective
More informationProof Theoretical Reasoning Lecture 3 Modal Logic S5 and Hypersequents
Proof Theoretical Reasoning Lecture 3 Modal Logic S5 and Hypersequents Revantha Ramanayake and Björn Lellmann TU Wien TRS Reasoning School 2015 Natal, Brasil Outline Modal Logic S5 Sequents for S5 Hypersequents
More informationModal and temporal logic
Modal and temporal logic N. Bezhanishvili I. Hodkinson C. Kupke Imperial College London 1 / 83 Overview Part II 1 Soundness and completeness. Canonical models. 3 lectures. 2 Finite model property. Filtrations.
More informationInquisitive Logic. Journal of Philosophical Logic manuscript No. (will be inserted by the editor) Ivano Ciardelli Floris Roelofsen
Journal of Philosophical Logic manuscript No. (will be inserted by the editor) Inquisitive Logic Ivano Ciardelli Floris Roelofsen Received: 26 August 2009 / Accepted: 1 July 2010 Abstract This paper investigates
More informationThe Importance of Being Formal. Martin Henz. February 5, Propositional Logic
The Importance of Being Formal Martin Henz February 5, 2014 Propositional Logic 1 Motivation In traditional logic, terms represent sets, and therefore, propositions are limited to stating facts on sets
More informationOn 3-valued paraconsistent Logic Programming
Marcelo E. Coniglio Kleidson E. Oliveira Institute of Philosophy and Human Sciences and Centre For Logic, Epistemology and the History of Science, UNICAMP, Brazil Support: FAPESP Syntax Meets Semantics
More informationSome Non-Classical Approaches to the Brandenburger-Keisler Paradox
Some Non-Classical Approaches to the Brandenburger-Keisler Paradox Can BAŞKENT The Graduate Center of the City University of New York cbaskent@gc.cuny.edu www.canbaskent.net KGB Seminar The Graduate Center
More informationOutline. 1 Background and Aim. 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion
Outline 1 Background and Aim 2 Main results (in the paper) 3 More results (not in the paper) 4 Conclusion De & Omori (Konstanz & Kyoto/JSPS) Classical and Empirical Negation in SJ AiML 2016, Sept. 2, 2016
More informationFirst-Order Intuitionistic Logic with Decidable Propositional Atoms
First-Order Intuitionistic Logic with Decidable Propositional Atoms Alexander Sakharov alex@sakharov.net http://alex.sakharov.net Abstract First-order intuitionistic logic extended with the assumption
More informationChapter 3: Propositional Calculus: Deductive Systems. September 19, 2008
Chapter 3: Propositional Calculus: Deductive Systems September 19, 2008 Outline 1 3.1 Deductive (Proof) System 2 3.2 Gentzen System G 3 3.3 Hilbert System H 4 3.4 Soundness and Completeness; Consistency
More informationcse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018
cse371/mat371 LOGIC Professor Anita Wasilewska Fall 2018 Chapter 7 Introduction to Intuitionistic and Modal Logics CHAPTER 7 SLIDES Slides Set 1 Chapter 7 Introduction to Intuitionistic and Modal Logics
More informationModal Logic of Forcing Classes
Outline CUNY Graduate Center Department of Mathematics March 11, 2016 Outline Outline 1 Outline 1 Modal Logic Background Modal Axioms K (ϕ ψ) ( ϕ ψ) T ϕ ϕ 4 ϕ ϕ.2 ϕ ϕ.3 ( ϕ ψ) [(ϕ ψ) (ψ ϕ)] 5 ϕ ϕ Modal
More informationCut-Elimination and Quantification in Canonical Systems
A. Zamansky A. Avron Cut-Elimination and Quantification in Canonical Systems Abstract. Canonical propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules
More informationEquivalents of Mingle and Positive Paradox
Eric Schechter Equivalents of Mingle and Positive Paradox Abstract. Relevant logic is a proper subset of classical logic. It does not include among itstheoremsanyof positive paradox A (B A) mingle A (A
More information260 Index. Cut (cont.) rank, 193, 202 segment, 201 Cut-off subtraction, 211
References J. Barwise (ed.). Handbook of Mathematical Logic. North-Holland, Amsterdam, 1977 G. Boolos. The Logic of Provability. Cambridge University Press, Cambridge, 1993 E. Börger. Computability, Complexity,
More informationMadhavan Mukund Chennai Mathematical Institute
AN INTRODUCTION TO LOGIC Madhavan Mukund Chennai Mathematical Institute E-mail: madhavan@cmiacin Abstract ese are lecture notes for an introductory course on logic aimed at graduate students in Computer
More informationInquisitive Logic. Ivano Ciardelli.
Inquisitive Logic Ivano Ciardelli www.illc.uva.nl/inquisitive-semantics Information states A state is a set of valuations. Support Let s be a state. The system InqB 1. s = p iff w s : w(p) = 1 2. s = iff
More informationForcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus Hugo Herbelin 1 and Gyesik Lee 2 1 INRIA & PPS, Paris Université 7 Paris, France Hugo.Herbelin@inria.fr 2 ROSAEC center,
More informationExtended Abstract: Reconsidering Intuitionistic Duality
Extended Abstract: Reconsidering Intuitionistic Duality Aaron Stump, Harley Eades III, Ryan McCleeary Computer Science The University of Iowa 1 Introduction This paper proposes a new syntax and proof system
More informationSemantical study of intuitionistic modal logics
Semantical study of intuitionistic modal logics Department of Intelligence Science and Technology Graduate School of Informatics Kyoto University Kensuke KOJIMA January 16, 2012 Abstract We investigate
More informationRules of Inference. Lecture 1 Tuesday, September 24. Rosalie Iemhoff Utrecht University, The Netherlands
Rules of Inference Lecture 1 Tuesday, September 24 Rosalie Iemhoff Utrecht University, The Netherlands TbiLLC 2013 Gudauri, Georgia, September 23-27, 2013 1 / 26 Questions Given a theorem, what are the
More informationKrivine s Intuitionistic Proof of Classical Completeness (for countable languages)
Krivine s Intuitionistic Proof of Classical Completeness (for countable languages) Berardi Stefano Valentini Silvio Dip. Informatica Dip. Mat. Pura ed Applicata Univ. Torino Univ. Padova c.so Svizzera
More informationImplicational F -Structures and Implicational Relevance. Logics. A. Avron. Sackler Faculty of Exact Sciences. School of Mathematical Sciences
Implicational F -Structures and Implicational Relevance Logics A. Avron Sackler Faculty of Exact Sciences School of Mathematical Sciences Tel Aviv University Ramat Aviv 69978, Israel Abstract We describe
More informationOn interpolation in existence logics
On interpolation in existence logics Matthias Baaz and Rosalie Iemhoff Technical University Vienna, Wiedner Hauptstrasse 8-10, A-1040 Vienna, Austria baaz@logicat, iemhoff@logicat, http://wwwlogicat/people/baaz,
More informationA generalization of modal definability
A generalization of modal definability Tin Perkov Polytechnic of Zagreb Abstract. Known results on global definability in basic modal logic are generalized in the following sense. A class of Kripke models
More informationPropositional Logic Language
Propositional Logic Language A logic consists of: an alphabet A, a language L, i.e., a set of formulas, and a binary relation = between a set of formulas and a formula. An alphabet A consists of a finite
More informationBETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR
Bulletin of the Section of Logic Volume 38:3/4 (2009), pp. 123 133 Kordula Świȩtorzecka BETWEEN THE LOGIC OF PARMENIDES AND THE LOGIC OF LIAR Abstract In the presented text we shall focus on some specific
More informationOn Sequent Calculi for Intuitionistic Propositional Logic
On Sequent Calculi for Intuitionistic Propositional Logic Vítězslav Švejdar Jan 29, 2005 The original publication is available at CMUC. Abstract The well-known Dyckoff s 1992 calculus/procedure for intuitionistic
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationModal Logic. UIT2206: The Importance of Being Formal. Martin Henz. March 19, 2014
Modal Logic UIT2206: The Importance of Being Formal Martin Henz March 19, 2014 1 Motivation The source of meaning of formulas in the previous chapters were models. Once a particular model is chosen, say
More informationALL NORMAL EXTENSIONS OF S5-SQUARED ARE FINITELY AXIOMATIZABLE
ALL NORMAL EXTENSIONS OF S5-SQUARED ARE FINITELY AXIOMATIZABLE Nick Bezhanishvili and Ian Hodkinson Abstract We prove that every normal extension of the bi-modal system S5 2 is finitely axiomatizable and
More informationFiltrations and Basic Proof Theory Notes for Lecture 5
Filtrations and Basic Proof Theory Notes for Lecture 5 Eric Pacuit March 13, 2012 1 Filtration Let M = W, R, V be a Kripke model. Suppose that Σ is a set of formulas closed under subformulas. We write
More informationBasic Algebraic Logic
ELTE 2013. September Today Past 1 Universal Algebra 1 Algebra 2 Transforming Algebras... Past 1 Homomorphism 2 Subalgebras 3 Direct products 3 Varieties 1 Algebraic Model Theory 1 Term Algebras 2 Meanings
More informationPart II Logic and Set Theory
Part II Logic and Set Theory Theorems Based on lectures by I. B. Leader Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationGeneral Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations OFER ARIELI AND ARNON AVRON, Department of Computer Science, School of Mathematical Sciences, Tel-Aviv University,
More informationA Remark on Propositional Kripke Frames Sound for Intuitionistic Logic
A Remark on Propositional Kripke Frames Sound for Intuitionistic Logic Dmitrij Skvortsov All-Russian Institute of Scientific and Technical Information, VINITI Russian Academy of Science Usievicha, 20,
More informationLOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC
Logic and Logical Philosophy Volume 9 (2001), 91 107 S. P. Odintsov LOGIC OF CLASSICAL REFUTABILITY AND CLASS OF EXTENSIONS OF MINIMAL LOGIC Introduction This article continues the investigation of paraconsistent
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationExogenous Semantics Approach to Enriching Logics
Exogenous Semantics Approach to Enriching Logics Paulo Mateus, Amílcar Sernadas, and Cristina Sernadas Abstract. The exogenous semantics approach to enriching a logic consists in defining each model in
More informationConstructive analysis
Constructive analysis Philosophy, Proof and Fundamentals Hajime Ishihara School of Information Science Japan Advanced Institute of Science and Technology (JAIST) Nomi, Ishikawa 923-1292, Japan Interval
More informationSemantics for Propositional Logic
Semantics for Propositional Logic An interpretation (also truth-assignment, valuation) of a set of propositional formulas S is a function that assigns elements of {f,t} to the propositional variables in
More informationTHE LOGIC OF OPINION
THE LOGIC OF OPINION Ionel Narița West University of Timișoara Abstract: Unlike truth values that, accordingly to the principles of logic, are only two, there can be distinguished three values of opinion
More informationExtensions of Analytic Pure Sequent Calculi with Modal Operators
Extensions of Analytic Pure Sequent Calculi with Modal Operators Yoni Zohar Tel Aviv University (joint work with Ori Lahav) GeTFun 4.0 Motivation C 1 [Avron, Konikowska, Zamansky 12] Positive rules of
More informationNatural Deduction. Formal Methods in Verification of Computer Systems Jeremy Johnson
Natural Deduction Formal Methods in Verification of Computer Systems Jeremy Johnson Outline 1. An example 1. Validity by truth table 2. Validity by proof 2. What s a proof 1. Proof checker 3. Rules of
More information1. Propositional Calculus
1. Propositional Calculus Some notes for Math 601, Fall 2010 based on Elliott Mendelson, Introduction to Mathematical Logic, Fifth edition, 2010, Chapman & Hall. 2. Syntax ( grammar ). 1.1, p. 1. Given:
More informationSequent calculi of quantum logic with strict implication
CTFM 2015 9/7 Sequent calculi of quantum logic with strict implication Tokyo Institute of Technology Graduate School of Information Science and Engineering Tomoaki Kawano About quantum logic Sequent calculi
More information185.A09 Advanced Mathematical Logic
185.A09 Advanced Mathematical Logic www.volny.cz/behounek/logic/teaching/mathlog13 Libor Běhounek, behounek@cs.cas.cz Lecture #1, October 15, 2013 Organizational matters Study materials will be posted
More informationCOMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning
COMP9414, Monday 26 March, 2012 Propositional Logic 2 COMP9414: Artificial Intelligence Propositional Logic: Automated Reasoning Overview Proof systems (including soundness and completeness) Normal Forms
More informationPropositional Logic Sequent Calculus
1 / 16 Propositional Logic Sequent Calculus Mario Alviano University of Calabria, Italy A.Y. 2017/2018 Outline 2 / 16 1 Intuition 2 The LK system 3 Derivation 4 Summary 5 Exercises Outline 3 / 16 1 Intuition
More informationGeneral methods in proof theory for modal logic - Lecture 1
General methods in proof theory for modal logic - Lecture 1 Björn Lellmann and Revantha Ramanayake TU Wien Tutorial co-located with TABLEAUX 2017, FroCoS 2017 and ITP 2017 September 24, 2017. Brasilia.
More informationLogics above S4 and the Lebesgue measure algebra
Logics above S4 and the Lebesgue measure algebra Tamar Lando Abstract We study the measure semantics for propositional modal logics, in which formulas are interpreted in the Lebesgue measure algebra M,
More informationSocratic Proofs for Some Temporal Logics RESEARCH REPORT
Section of Logic and Cognitive Science Institute of Psychology Adam Mickiewicz University in Poznań Mariusz Urbański Socratic Proofs for Some Temporal Logics RESEARCH REPORT Szamarzewskiego 89, 60-589
More informationON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS
Takao Inoué ON THE ATOMIC FORMULA PROPERTY OF HÄRTIG S REFUTATION CALCULUS 1. Introduction It is well-known that Gentzen s sequent calculus LK enjoys the so-called subformula property: that is, a proof
More informationTruthmaker Maximalism defended again. Eduardo Barrio and Gonzalo Rodriguez-Pereyra
1 Truthmaker Maximalism defended again 1 Eduardo Barrio and Gonzalo Rodriguez-Pereyra 1. Truthmaker Maximalism is the thesis that every truth has a truthmaker. Milne (2005) attempts to refute it using
More informationDeep Sequent Systems for Modal Logic
Deep Sequent Systems for Modal Logic Kai Brünnler abstract. We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed from the axioms t, b,4, 5. They employ a form
More informationOn Constructive Linear-Time Temporal Logic
Replace this file with prentcsmacro.sty for your meeting, or with entcsmacro.sty for your meeting. Both can be found at the ENTCS Macro Home Page. On Constructive Linear-Time Temporal Logic Kensuke Kojima
More informationNON-DETERMINISTIC SEMANTICS FOR LOGICAL SYSTEMS
ARNON AVRON AND ANNA ZAMANSKY NON-DETERMINISTIC SEMANTICS FOR LOGICAL SYSTEMS 1.1 The Key Idea 1 INTRODUCTION The principle of truth-functionality (or compositionality) is a basic principle in many-valued
More informationPrefixed Tableaus and Nested Sequents
Prefixed Tableaus and Nested Sequents Melvin Fitting Dept. Mathematics and Computer Science Lehman College (CUNY), 250 Bedford Park Boulevard West Bronx, NY 10468-1589 e-mail: melvin.fitting@lehman.cuny.edu
More informationInducing syntactic cut-elimination for indexed nested sequents
Inducing syntactic cut-elimination for indexed nested sequents Revantha Ramanayake Technische Universität Wien (Austria) IJCAR 2016 June 28, 2016 Revantha Ramanayake (TU Wien) Inducing syntactic cut-elimination
More informationLogic for Computer Science - Week 4 Natural Deduction
Logic for Computer Science - Week 4 Natural Deduction 1 Introduction In the previous lecture we have discussed some important notions about the semantics of propositional logic. 1. the truth value of a
More informationModal Logic XXI. Yanjing Wang
Modal Logic XXI Yanjing Wang Department of Philosophy, Peking University May 17th, 2017 Advanced Modal Logic (2017 Spring) 1 Completeness via Canonicity Soundness and completeness Definition (Soundness)
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationRelational semantics for a fragment of linear logic
Relational semantics for a fragment of linear logic Dion Coumans March 4, 2011 Abstract Relational semantics, given by Kripke frames, play an essential role in the study of modal and intuitionistic logic.
More informationLecture Notes on Combinatory Modal Logic
Lecture Notes on Combinatory Modal Logic 15-816: Modal Logic Frank Pfenning Lecture 9 February 16, 2010 1 Introduction The connection between proofs and program so far has been through a proof term assignment
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationInterpolation via translations
Interpolation via translations Walter Carnielli 2,3 João Rasga 1,3 Cristina Sernadas 1,3 1 DM, IST, TU Lisbon, Portugal 2 CLE and IFCH, UNICAMP, Brazil 3 SQIG - Instituto de Telecomunicações, Portugal
More informationModel theory of bounded arithmetic with applications to independence results. Morteza Moniri
Model theory of bounded arithmetic with applications to independence results Morteza Moniri Abstract In this paper we apply some new and some old methods in order to construct classical and intuitionistic
More informationPropositional logic (revision) & semantic entailment. p. 1/34
Propositional logic (revision) & semantic entailment p. 1/34 Reading The background reading for propositional logic is Chapter 1 of Huth/Ryan. (This will cover approximately the first three lectures.)
More informationKRIPKE S THEORY OF TRUTH 1. INTRODUCTION
KRIPKE S THEORY OF TRUTH RICHARD G HECK, JR 1. INTRODUCTION The purpose of this note is to give a simple, easily accessible proof of the existence of the minimal fixed point, and of various maximal fixed
More information02 Propositional Logic
SE 2F03 Fall 2005 02 Propositional Logic Instructor: W. M. Farmer Revised: 25 September 2005 1 What is Propositional Logic? Propositional logic is the study of the truth or falsehood of propositions or
More informationAn Alternative To The Iteration Operator Of. Propositional Dynamic Logic. Marcos Alexandre Castilho 1. IRIT - Universite Paul Sabatier and
An Alternative To The Iteration Operator Of Propositional Dynamic Logic Marcos Alexandre Castilho 1 IRIT - Universite Paul abatier and UFPR - Universidade Federal do Parana (Brazil) Andreas Herzig IRIT
More informationadmissible and derivable rules in intuitionistic logic
admissible and derivable rules in intuitionistic logic Paul Rozière Equipe de Logique, CNRS UA 753 Université Paris 7 2 place Jussieu, 75230 PARIS cedex 05 roziere@logique.jussieu.fr preliminary draft,
More informationIntroduction to Logic in Computer Science: Autumn 2006
Introduction to Logic in Computer Science: Autumn 2006 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today The first part of the course will
More informationChapter 11: Automated Proof Systems (1)
Chapter 11: Automated Proof Systems (1) SYSTEM RS OVERVIEW Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. Automated systems
More informationCut and Pay. MARCELO FINGER University of Sao Paulo, Brazil DOV GABBAY King s College, London
Journal of Logic, Language and Information (2006) 15: 195 218 C Springer 2006 DOI: 10.1007/s10849-005-9001-y Cut and Pay MARCELO FINGER University of Sao Paulo, Brazil E-mail: mfinger@ime.usp.br DOV GABBAY
More informationAN ALTERNATIVE NATURAL DEDUCTION FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC
Bulletin of the Section of Logic Volume 45/1 (2016), pp 33 51 http://dxdoiorg/1018778/0138-068045103 Mirjana Ilić 1 AN ALTERNATIVE NATURAL DEDUCTION FOR THE INTUITIONISTIC PROPOSITIONAL LOGIC Abstract
More informationBoolean bunched logic: its semantics and completeness
Boolean bunched logic: its semantics and completeness James Brotherston Programming Principles, Logic and Verification Group Dept. of Computer Science University College London, UK J.Brotherston@ucl.ac.uk
More informationINF3170 Logikk Spring Homework #8 For Friday, March 18
INF3170 Logikk Spring 2011 Homework #8 For Friday, March 18 Problems 2 6 have to do with a more explicit proof of the restricted version of the completeness theorem: if = ϕ, then ϕ. Note that, other than
More information