A note on the strength of paraconsistent arithmetic
From MaRDI portal
Cites work
- \(\mathrm{LP}^{+}\), \(\mathrm{K3}^{+}\), \(\mathrm{FDE}^{+}\), and their `classical collapse'
- \textit{LFIs} and methods of classical recapture
- A SIMPLE APPROACH TOWARDS RECAPTURING CONSISTENT THEORIES IN PARACONSISTENT SETTINGS
- Axiomatizing Kripke's theory of truth
- AXIOMS FOR FINITE COLLAPSE MODELS OF ARITHMETIC
- Consistency and decidability in some paraconsistent arithmetics
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes)
- Inconsistent models for relevant arithmetics
- Inconsistent models of arithmetic. I: Finite models
- Is there an inconsistent primitive recursive relation?
- Linear arithmetic desecsed
- Logics of formal inconsistency
- Logics without the contraction rule
- NONCLASSICAL TRUTH WITH CLASSICAL STRENGTH. A PROOF-THEORETIC ANALYSIS OF COMPOSITIONAL TRUTH OVER HYPE
- On LP-models of arithmetic
- On paraconsistent downward Löwenheim-Skolem theorems
- On the costs of nonclassical logic
- Paraconsistent computation and dialetheic machines
- Paraconsistent Machines and their Relation to Quantum Computing
- Paraconsistent metatheory: new proofs with old tools
- Paradoxes and Inconsistent Mathematics
- Proof theory. The first step into impredicativity
- Relevant arithmetic
- Residuated lattices. An algebraic glimpse at substructural logics
- Saving Proof from Paradox: Gödel’s Paradox and the Inconsistency of Informal Mathematics
- Shrieking against gluts: the solution to the `just true' problem
- The dream of recapture
- The logic of paradox
- Transfinite numbers in paraconsistent set theory
- Truth in a logic of formal inconsistency: how classical can it get?
- Whither relevant arithmetic?
This page was built for publication: A note on the strength of paraconsistent arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7304896)
