Pseudo two-valued evaluation method for intermediate logics
From MaRDI portal
Let VAR be the variables of a propositional logic. Let \(R=\{a_ i\vee \neg a_ i,\neg (a_ i\vee \neg a_ i)|\) \(a_ i\in VAR\}\). A pseudo two-valued evaluation, \(f(\,)\), is a function on VAR into \(R\); and \(f(\,)\) is extended to the wffs in the usual way. The author investigates logics obtained by adding (\(\neg a\vee \neg \neg a)\) to logics \(L\) containing intuitionistic logic. The main theorem states that \(A\) is a theorem of such a logic iff \(L\vdash f(A)\) for all pseudo two-valued evaluations \(f(\,)\).
Recommendations
- Two-valued logic programs
- Pseudo-Boolean valued Prolog
- Pseudo-valuations on pre-logics
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
- scientific article; zbMATH DE number 1078559
- An approach to paraconsistent multivalued logic: evaluation by complex truth values
- scientific article; zbMATH DE number 1269582
- The expressive truth conditions of two-valued logic
- scientific article; zbMATH DE number 742723
Cited in
(7)- Gentzen-type formulation of the propositional logic LQ
- The simple substitution property of the intermediate propositional logics on finite slices
- The simple substitution property of Gödel's intermediate propositional logics \(S_ n\)'s
- Pseudo-valuations on pre-logics
- BOUNDED-ANALYTIC SEQUENT CALCULI AND EMBEDDINGS FOR HYPERSEQUENT LOGICS
- For Want of an ‘And’: A Puzzle about Non-Conservative Extension
- Some analytic systems of rules
This page was built for publication: Pseudo two-valued evaluation method for intermediate logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1820766)
