Constructible falsity and inexact predicates
From MaRDI portal
Publication:3693511
DOI10.2307/2274105zbMath0575.03016OpenAlexW2150425213MaRDI QIDQ3693511
No author found.
Publication date: 1984
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2274105
Related Items (92)
Routley star and hyperintensionality ⋮ Kripke-completeness and cut-elimination theorems for intuitionistic paradefinite logics with and without quasi-explosion ⋮ Vagueness as an epiphenomenon, and non-transitivity ⋮ Inconsistency-Tolerant Multi-Agent Calculus ⋮ Notes on Craig interpolation for LJ with strong negation ⋮ Realism, Antirealism, and Paraconsistency ⋮ Hoop twist-structures ⋮ Semantics-based nonmonotonic inference ⋮ Logical connectives for constructive modal logic ⋮ CUT FOR CORE LOGIC ⋮ Strong negation in intuitionistic style sequent systems for residuated lattices ⋮ Non-classical negation in the works of Helena Rasiowa and their impact on the theory of negation ⋮ On deductive bases for paraconsistent answer set semantics ⋮ Temporal BI: proof system, semantics and translations ⋮ Modal multilattice logic ⋮ Paraconsistent constructive logic with strong negation as a contraction-free relevant logic ⋮ SEMANTICS FOR PURE THEORIES OF CONNEXIVE IMPLICATION ⋮ Gentzen-type sequent calculi for extended Belnap-Dunn logics with classical negation: a general framework ⋮ Paraconsistent double negations as classical and intuitionistic negations ⋮ Kripke completeness of bi-intuitionistic multilattice logic and its connexive variant ⋮ Disentangling \textsf{FDE}-based paraconsistent modal logics ⋮ IMPROVING STRONG NEGATION ⋮ On the provable contradictions of the connexive logics \(\mathbf{C}\) and \(\mathbf{C3}\) ⋮ Belnap Constants and Nelson Logic ⋮ Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic ⋮ A more general general proof theory ⋮ HYPE: a system of hyperintensional logic (with an application to semantic paradoxes) ⋮ Tarskian consequence relations bilaterally: some familiar notions ⋮ The nature of entailment: an informational approach ⋮ Wansing's bi-intuitionistic logic: semantics, extension and unilateralisation ⋮ Paraconsistent double negation as a modal operator ⋮ Extending paraconsistent quantum logic: a single‐antecedent/succedent system approach ⋮ An algebraic investigation of the connexive logic \(\mathsf{C}\) ⋮ A simple way to overcome hyperconnexivity ⋮ Executability and connexivity in an interpretation of Griss ⋮ Reprint of: ``A more general general proof theory ⋮ Logical multilateralism ⋮ Falsification-aware calculi and semantics for normal modal logics including S4 and S5 ⋮ Double negation as minimal negation ⋮ On Synonymy in Proof-Theoretic Semantics: The Case of \(\mathtt{2Int}\) ⋮ Tableaux for logic programming with strong negation ⋮ \(\mathbf{BK}\)-lattices. Algebraic semantics for Belnapian modal logics ⋮ Normal modal substructural logics with strong negation ⋮ The lattice of Belnapian modal logics: Special extensions and counterparts ⋮ The subvariety of commutative residuated lattices represented by twist-products ⋮ Implicative twist-structures ⋮ An Invitation to New Essays on Belnap-Dunn Logic ⋮ K3, Ł3, LP, RM3, A3, FDE, M: How to Make Many-Valued Logics Work for You ⋮ Inferential Semantics, Paraconsistency, and Preservation of Evidence ⋮ On Non-transitive “Identity” ⋮ Modal and intuitionistic variants of extended Belnap-Dunn logic with classical negation ⋮ Lattice logic, bilattice logic and paraconsistent quantum logic: a unified framework based on monosequent systems ⋮ 1996–1997 Winter Meeting of the Association for Symbolic Logic ⋮ Proof theory of paraconsistent quantum logic ⋮ Inconsistency-tolerant temporal reasoning with hierarchical information ⋮ Paraconsistent computation tree logic ⋮ Modal extension of ideal paraconsistent four-valued logic and its subsystem ⋮ A variant of Thomason's first-order logic CF based on situations ⋮ Combining linear-time temporal logic with constructiveness and paraconsistency ⋮ A hierarchy of weak double negations ⋮ A general framework for FDE-based modal logics ⋮ Displaying the modal logic of consistency ⋮ Phase semantics and Petri net interpretation for resource-sensitive strong negation ⋮ Prawitz, Proofs, and Meaning ⋮ On the Methodology of Paraconsistent Logic ⋮ Why Paraconsistent Logics? ⋮ Handling inconsistency in knowledge systems ⋮ A decidable paraconsistent relevant logic: Gentzen system and Routley-Meyer semantics ⋮ Proof systems combining classical and paraconsistent negations ⋮ An epistemic approach to paraconsistency: a logic of evidence and truth ⋮ Inconsistent Models (and Infinite Models) for Arithmetics with Constructible Falsity ⋮ Bi-Classical Connexive Logic and its Modal Extension: Cut-elimination, completeness and duality ⋮ Connexive Conditional Logic. Part I ⋮ Paraconsistent Modal Logics ⋮ Alternative multilattice logics: an approach based on monosequent and indexed monosequent calculi ⋮ Neighbourhood semantics for FDE-based modal logics ⋮ SEQUENT CALCULI FOR SOME TRILATTICE LOGICS ⋮ Constructive negation, implication, and co-implication ⋮ Proof theory of Nelson's paraconsistent logic: a uniform perspective ⋮ Natural deduction systems for Nelson's paraconsistent logic and its neighbors ⋮ Compatibly involutive residuated lattices and the Nelson identity ⋮ Unnamed Item ⋮ Falsification-aware semantics and sequent calculi for classical logic ⋮ Embedding friendly first-order paradefinite and connexive logics ⋮ An extended paradefinite logic combining conflation, paraconsistent negation, classical negation, and classical implication: how to construct Nice Gentzen-type sequent calculi ⋮ First-order logics of evidence and truth with constant and variable domains ⋮ Normalisation for Some Quite Interesting Many-Valued Logics ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility ⋮ A non-deterministic view on non-classical negations ⋮ Gentzen-type methods for bilattice negation ⋮ Diamonds are a philosopher's best friends. The knowability paradox and modal epistemic relevance logic ⋮ Informational interpretation of substructural propositional logics
Cites Work
This page was built for publication: Constructible falsity and inexact predicates
