On the extension of intuitionistic propositional logic with Kreisel-Putnam's and Scott's schemes

Studia Logica 45 (1):55-68 (1986)
  Copy   BIBTEX

Abstract

LetSKP be the intermediate prepositional logic obtained by adding toI (intuitionistic p.l.) the axiom schemes:S = (( ) ) (Scott), andKP = ()()() (Kreisel-Putnam). Using Kripke's semantics, we prove:1) SKP has the finite model property; 2) SKP has the disjunction property. In the last section of the paper we give some results about Scott's logic S = I+S.

Categories

Keywords

Reprint years

DOI

10.1007/bf01881549

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 96,395

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Gentzen-type formulation of the prepositional logic LQ.Tsutomu Hosoi - 1988 - Studia Logica 47 (1):41 - 48.
A secondary semantics for Second Order Intuitionistic Propositional Logic.Mauro Ferrari, Camillo Fiorentini & Guido Fiorino - 2004 - Mathematical Logic Quarterly 50 (2):202-210.
Exhibiting Wide Families of Maximal Intermediate Propositional Logics with the Disjunction Property.Guido Bertolotti, Pierangelo Miglioli & Daniela Silvestrini - 1996 - Mathematical Logic Quarterly 42 (1):501-536.
Rasiowa–Harrop Disjunction Property.Gilda Ferreira - 2017 - Studia Logica 105 (3):649-664.
Intermediate logics with the same disjunctionless fragment as intuitionistic logic.Plerluigi Minari - 1986 - Studia Logica 45 (2):207 - 222.
The greatest extension of s4 into which intuitionistic logic is embeddable.Michael Zakharyaschev - 1997 - Studia Logica 59 (3):345-358.
Strongly decidable properties of modal and intuitionistic calculi.L. Maksimova - 2000 - Logic Journal of the IGPL 8 (6):797-819.
On the Finite Model Property of Weak Intuitionistic Tense Logic.Yu Peng, Zhe Lin & Fei Liang - 2021 - In Sujata Ghosh & Thomas Icard (eds.), Logic, Rationality, and Interaction: 8th International Workshop, Lori 2021, Xi’an, China, October 16–18, 2021, Proceedings. Springer Verlag. pp. 174-182.
On the computational content of intuitionistic propositional proofs.Samuel R. Buss & Pavel Pudlák - 2001 - Annals of Pure and Applied Logic 109 (1-2):49-64.
A New Solution to a Problem of Hosoi and Ono.Michael Zakharyaschev - 1994 - Notre Dame Journal of Formal Logic 35 (3):450-457.

Analytics

Added to PP
2009-01-28

Downloads
36 (#499,367)

6 months
9 (#708,892)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Pierluigi Minari
Università degli Studi di Firenze

Citations of this work

Add more citations

References found in this work

Decidability of S4.1.Krister Segerberg - 1968 - Theoria 34 (1):7-20.
Decidability of S4.1.Krister Segerberg - 1968 - Theoria 34 (1):7-20.
The decidability of certain intermediate propositional logics.C. G. Mckay - 1968 - Journal of Symbolic Logic 33 (2):258-264.

View all 9 references / Add more references