The following pages link to (Q4397069):
Displayed 50 items.
- The decision problem of provability logic with only one atom (Q1423633) (← links)
- On the desirability of mechanizing calculational proofs (Q1607098) (← links)
- Saving the truth schema from paradox (Q1610606) (← links)
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics (Q1668101) (← links)
- Boolean paradoxes and revision periods (Q1685479) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\) (Q1743993) (← links)
- Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations (Q1756596) (← links)
- Automated search for Gödel's proofs (Q1772785) (← links)
- Paraconsistent informational logic (Q1775866) (← links)
- The knower paradox in the light of provability interpretations of modal logic (Q1778104) (← links)
- Modal logic interpretation of Dempster-Shafer theory: An infinite case (Q1809349) (← links)
- A revenge-immune solution to the semantic paradoxes (Q1810819) (← links)
- Possible-worlds semantics for modal notions conceived as predicates (Q1810820) (← links)
- Provability algebras and proof-theoretic ordinals. I (Q1877092) (← links)
- A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic (Q1893136) (← links)
- Modal extensions of sub-classical logics for recovering classical logic (Q1945706) (← links)
- Anderson and Belnap's invitation to sin (Q1959326) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Reflexive-insensitive logics, the boxdot translation, and the modal logic of generic absoluteness (Q1982014) (← links)
- Distilling the requirements of Gödel's incompleteness theorems with a proof assistant (Q2051568) (← links)
- Two variants of noncontingency operator (Q2075274) (← links)
- On independent axiomatizability of quasi-normal modal logics (Q2082254) (← links)
- Modal companions of \(K4^+\) (Q2082262) (← links)
- Interpolation properties for Sacchetti's logics (Q2097057) (← links)
- On inclusions between quantified provability logics (Q2115286) (← links)
- On Blass translation for Leśniewski's propositional ontology and modal logics (Q2115291) (← links)
- Reflection algebras and conservation results for theories of iterated truth (Q2120976) (← links)
- Did Descartes make a diagonal argument? (Q2121477) (← links)
- Effectively constructible fixed points in Sacchetti's modal logics of provability (Q2134275) (← links)
- Designing paradoxes: a revision-theoretic approach (Q2155938) (← links)
- Friedman-reflexivity (Q2159935) (← links)
- Rosser provability and normal modal logics (Q2186698) (← links)
- A proof theory for the logic of provability in true arithmetic (Q2193977) (← links)
- There is no paradox of logical validity (Q2254573) (← links)
- Modal provability foundations for argumentation networks (Q2269511) (← links)
- A formally verified abstract account of Gödel's incompleteness theorems (Q2305432) (← links)
- The arithmetics of a theory (Q2345393) (← links)
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) (Q2370371) (← links)
- Interconnection of the lattices of extensions of four logics (Q2399606) (← links)
- Interpretability suprema in Peano arithmetic (Q2402961) (← links)
- Variations on a Montagovian theme (Q2443347) (← links)
- Montague's paradox, informal provability, and explicit modal logic (Q2452676) (← links)
- A remark on equivalent Rosser sentences (Q2470037) (← links)
- A quantified logic of evidence (Q2478547) (← links)
- On modal logic of deductive closure (Q2498907) (← links)
- Note on some fixed point constructions in provability logic (Q2499296) (← links)
- No escape from Vardanyan's theorem (Q2501168) (← links)
- Variations on a theme of Curry (Q2505136) (← links)