Explorations and computations in bidirectional intuitionistic propositional logic
نویسنده
چکیده
This paper investigates the semantics of the intuitionistic propositional logic (IPL) extended with subtraction, also known as the HeytingBrouwer logic or biIPL. It introduces and extends some basic concepts and theorems in the Kripke semantics of intuitionistic propositional logic to obtain new results on the exact models of fragments in the bidirectional case. The paper also includes results of the computations in fragments of biIPL, based on some of these exact models.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملIntuitionistic Propositional Logic with Only Equivalence Has No Interpolation
We will show in this paper that there is no interpolation theorem for the fragment of pure equivalence in intuitionistic propositional logic. The computer program that was used to calculate the counterexample by computations on a nite Kripke model is brieey sketched.
متن کاملBidirectional Decision Procedures for the Intuitionistic Propositional Modal Logic IS4
We present a multi-context focused sequent calculus whose derivations are in bijective correspondence with normal natural deductions in the propositional fragment of the intuitionistic modal logic IS4. This calculus, suitable for the enumeration of normal proofs, is the starting point for the development of a sequent calculus-based bidirectional decision procedure for propositional IS4. In this...
متن کاملSubstitutions of Sigma10 - sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic
This paper is concerned with notions of consequence. On the one hand we study admissible consequence, specifically for substitutions of Σ1sentences over Heyting Arithmetic (HA). On the other hand we study preservativity relations. The notion of preservativity of sentences over a given theory is a dual of the notion of conservativity of formulas over a given theory. We show that admissible conse...
متن کاملOn the computational content of intuitionistic propositional proofs
The intuitionistic calculus was introduced to capture reasoning in constructive mathematics. As such it has much more constructive character than classical logic. This property of the intuitionistic calculus has been extensively studied, but mostly from the point of view of computability and little has been proved about computational complexity. The aim of this paper is to show that the constru...
متن کامل