The following pages link to (Q4397069):
Displayed 50 items.
- Intuitionistic logic and modality via topology (Q598307) (← links)
- The modal logic of Gödel sentences (Q600852) (← links)
- Semantics for dual preferential entailment (Q839649) (← links)
- Modal logic for other-world agnostics: Neutrality and Halldén incompleteness (Q861518) (← links)
- An impossibility theorem on beliefs in games (Q863184) (← links)
- Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 (Q873911) (← links)
- Uniform interpolation and propositional quantifiers in modal logics (Q878154) (← links)
- Expressive power and incompleteness of propositional logics (Q965859) (← links)
- On modal \(\mu \)-calculus and Gödel-Löb logic (Q1015480) (← links)
- Jump liars and Jourdain's card via the relativized T-scheme (Q1015486) (← links)
- Around provability logic (Q1035652) (← links)
- A note on the fixed point for the polynomials of a Boolean algebra with an operator of endomorphism (Q1296423) (← links)
- Completeness and definability in the logic of noncontingency (Q1347608) (← links)
- The structure of lattices of subframe logics (Q1361249) (← links)
- The fixed point property in modal logic (Q1409307) (← links)
- Mathematical modal logic: A view of its evolution (Q1422628) (← links)
- 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)
- 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)
- Anderson and Belnap's invitation to sin (Q1959326) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Modal provability foundations for argumentation networks (Q2269511) (← links)
- A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) (Q2370371) (← 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)
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) (Q2565986) (← links)
- (Q2776807) (← links)
- Paraconsistent conjectural deduction based on logical entropy measures I: C-systems as non-standard inference framework (Q3647231) (← links)
- Formal verification of multi-agent systems behaviour emerging from cognitive task analysis (Q4467046) (← links)
- Realization of Intuitionistic Logic by Proof Polynomials (Q4531579) (← links)
- The mathematical significance of proof theory (Q5301856) (← links)
- The modal logic of forcing (Q5437615) (← links)
- Symmetric Logic of Proofs (Q5452174) (← links)
- Worms, gaps, and hydras (Q5462986) (← links)
- Which modal logic is the right one? (Q5937846) (← links)
- Rules and arithmetics (Q5937848) (← links)
- An open formalism against incompleteness (Q5937853) (← links)
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic (Q5957858) (← links)