scientific article; zbMATH DE number 1170091
From MaRDI portal
Publication:4397069
Recommendations
Cited in
(only showing first 100 items - show all)- On modal \(\mu \)-calculus and Gödel-Löb logic
- Jump liars and Jourdain's card via the relativized T-scheme
- Around provability logic
- Proving possibility properties
- A note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphism
- Logic of proofs
- Completeness and definability in the logic of noncontingency
- The structure of lattices of subframe logics
- The fixed point property in modal logic
- Mathematical modal logic: A view of its evolution
- The decision problem of provability logic with only one atom
- On the desirability of mechanizing calculational proofs
- Saving the truth schema from paradox
- Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics
- Boolean paradoxes and revision periods
- Lewis meets Brouwer: constructive strict implication
- The omega-rule interpretation of transfinite provability logic
- Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
- Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations
- Automated search for Gödel's proofs
- Paraconsistent informational logic
- The knower paradox in the light of provability interpretations of modal logic
- Modal logic interpretation of Dempster-Shafer theory: An infinite case
- A revenge-immune solution to the semantic paradoxes
- Possible-worlds semantics for modal notions conceived as predicates
- Provability algebras and proof-theoretic ordinals. I
- A simple proof of arithmetical completeness for \(\Pi_ 1\)-conservativity logic
- Modal extensions of sub-classical logics for recovering classical logic
- Anderson and Belnap's invitation to sin
- Parameter free induction and provably total computable functions
- Reflexive-insensitive logics, the boxdot translation, and the modal logic of generic absoluteness
- Distilling the requirements of Gödel's incompleteness theorems with a proof assistant
- Two variants of noncontingency operator
- On independent axiomatizability of quasi-normal modal logics
- Modal companions of \(K4^+\)
- Interpolation properties for Sacchetti's logics
- On inclusions between quantified provability logics
- On Blass translation for Leśniewski's propositional ontology and modal logics
- Reflection algebras and conservation results for theories of iterated truth
- Did Descartes make a diagonal argument?
- Effectively constructible fixed points in Sacchetti's modal logics of provability
- Designing paradoxes: a revision-theoretic approach
- Friedman-reflexivity
- Rosser provability and normal modal logics
- A proof theory for the logic of provability in true arithmetic
- There is no paradox of logical validity
- Modal provability foundations for argumentation networks
- A formally verified abstract account of Gödel's incompleteness theorems
- The arithmetics of a theory
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\)
- Interconnection of the lattices of extensions of four logics
- Interpretability suprema in Peano arithmetic
- Variations on a Montagovian theme
- Montague's paradox, informal provability, and explicit modal logic
- A remark on equivalent Rosser sentences
- A quantified logic of evidence
- On modal logic of deductive closure
- Note on some fixed point constructions in provability logic
- No escape from Vardanyan's theorem
- Variations on a theme of Curry
- A simplified proof of arithmetical completeness theorem for provability logic GLP
- Paradoxes of interaction?
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)
- De-modalizing the language. The case of physics
- Deducibility and independence in Beklemishev's autonomous provability calculus
- Provability logic: models within models in Peano arithmetic
- scientific article; zbMATH DE number 1670501 (Why is no real title available?)
- J-Calc: a typed lambda calculus for intuitionistic justification logic
- Incompleteness and fixed points
- The closed fragment of IL is PSPACE hard
- A mechanised proof of Gödel's incompleteness theorems using Nominal Isabelle
- Truth and the Liar
- What is the correct logic of necessity, actuality and apriority?
- A machine-assisted proof of Gödel's incompleteness theorems for the theory of hereditarily finite sets
- A New Arithmetically Incomplete First-Order Extension of Gl All Theorems of Which Have Cut Free Proofs
- The Logic of Justification
- Some computational constraints in epistemic logic
- Build your own clarithmetic. I: Setup and completeness
- Free and projective bimodal symmetric Gödel algebras
- An epistemic logic with hypotheses
- Liar-type paradoxes and the incompleteness phenomena
- Solovay-type theorems for circular definitions
- Paraconsistent or paracomplete?
- scientific article; zbMATH DE number 5157044 (Why is no real title available?)
- The Henkin sentence
- Paraconsistent conjectural deduction based on logical entropy measures. I: C-systems as non-standard inference framework
- On predicate provability logics and binumerations of fragments of Peano arithmetic
- The iterative conception of set. A (bi-)modal axiomatisation
- Positive provability logic for uniform reflection principles
- Incompleteness Theorems
- Provability and interpretability logics with restricted realizations
- GoedelGod
- Formal verification of multi-agent systems behaviour emerging from cognitive task analysis
- Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases
- Realization of Intuitionistic Logic by Proof Polynomials
- On provability logics with linearly ordered modalities
- Many-valued logic of informal provability: a non-deterministic strategy
- A note on Barcan formula
- Logic. A very short introduction
- Labelling ideality and subideality
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397069)
