On an interpretation of second order quantification in first order intuitionistic propositional logic
Graduate studies at Western
Journal of Symbolic Logic 57 (1):33-52 (1992)
|Abstract||We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, φ, built up from propositional variables (p,q,r,...) and falsity $(\perp)$ using conjunction $(\wedge)$ , disjunction (∨) and implication (→). Write $\vdash\phi$ to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula φ there exists a formula Apφ (effectively computable from φ), containing only variables not equal to p which occur in φ, and such that for all formulas ψ not involving $p, \vdash \psi \rightarrow A_p\phi$ if and only if $\vdash \psi \rightarrow \phi$ . Consequently quantification over propositional variables can be modelled in IpC, and there is an interpretation of the second order propositional calculus, IpC2, in IpC which restricts to the identity on first order propositions. An immediate corollary is the strengthening of the usual interpolation theorem for IpC to the statement that there are least and greatest interpolant formulas for any given pair of formulas. The result also has a number of interesting consequences for the algebraic counterpart of IpC, the theory of Heyting algebras. In particular we show that a model of IpC2 can be constructed whose algebra of truth-values is equal to any given Heyting algebra|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Philip Kremer (1997). On the Complexity of Propositional Quantification in Intuitionistic Logic. Journal of Symbolic Logic 62 (2):529-544.
Agustín Rayo (2002). Frege's Unofficial Arithmetic. Journal of Symbolic Logic 67 (4):1623-1638.
Carlo Dalla Pozza & Claudio Garola (1995). A Pragmatic Interpretation of Intuitionistic Propositional Logic. Erkenntnis 43 (1):81 - 109.
Morten H. Sørensen & Paweł Urzyczyn (2010). A Syntactic Embedding of Predicate Logic Into Second-Order Propositional Logic. Notre Dame Journal of Formal Logic 51 (4):457-473.
Romà J. Adillon & Ventura Verdú (2000). On a Contraction-Less Intuitionistic Propositional Logic with Conjunction and Fusion. Studia Logica 65 (1):11-30.
Giovanni Sambin (1976). An Effective Fixed-Point Theorem in Intuitionistic Diagonalizable Algebras. Studia Logica 35 (4):345 - 361.
Dick De Jongh & L. A. Chagrova (1995). The Decidability of Dependency in Intuitionistic Propositional Logi. Journal of Symbolic Logic 60 (2):498 - 504.
Tomasz Połacik (1998). Propositional Quantification in the Monadic Fragment of Intuitionistic Logic. Journal of Symbolic Logic 63 (1):269-300.
Wim Ruitenburg (1984). On the Period of Sequences (an(P)) in Intuitionistic Propositional Calculus. Journal of Symbolic Logic 49 (3):892 - 899.
Tomasz Połacik (1994). Second Order Propositional Operators Over Cantor Space. Studia Logica 53 (1):93 - 105.
Added to index2009-01-28
Total downloads6 ( #155,400 of 757,742 )
Recent downloads (6 months)1 ( #63,427 of 757,742 )
How can I increase my downloads?