The simple substitution property of the intermediate propositional logics on finite slices
From MaRDI portal
The simple substitution property (SSP) was introduced by the reviewer [Stud. Logica 45, 3-8 (1986; Zbl 0615.03009)], but he did not give it a name. The author of the paper, a student of the reviewer, provided the name SSP by an advice of the reviewer. If a logic has SSP, then we can have a systematic and easy method for proving or disproving a formula in it by an axiomatic way. The paper proves for logics on finite slices that they have SSP if and only if they have finite characteristic models.
Recommendations
Cites work
- scientific article; zbMATH DE number 4142009 (Why is no real title available?)
- scientific article; zbMATH DE number 4164811 (Why is no real title available?)
- scientific article; zbMATH DE number 3259885 (Why is no real title available?)
- scientific article; zbMATH DE number 3300568 (Why is no real title available?)
- Pseudo two-valued evaluation method for intermediate logics
- Untersuchungen über das logische Schliessen. I
Cited in
(6)- The simple substitution property of Gödel's intermediate propositional logics \(S_ n\)'s
- scientific article; zbMATH DE number 4164811 (Why is no real title available?)
- scientific article; zbMATH DE number 736425 (Why is no real title available?)
- Generalized tableau systems for intermediate propositional logics
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
- On the simple substitution property for superintuitionistic and modal propositional logics
This page was built for publication: The simple substitution property of the intermediate propositional logics on finite slices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208115)
