The following pages link to (Q3809769):
Displaying 13 items.
- On predicate provability logics and binumerations of fragments of Peano arithmetic (Q377475) (← links)
- On the complexity of arithmetical interpretations of modal formulae (Q688859) (← links)
- Decidable and enumerable predicate logics of provability (Q750418) (← links)
- The predicate modal logic of provability (Q800346) (← links)
- Provability in predicate product logic (Q884950) (← links)
- Quantified modal logic and self-reference (Q1097256) (← links)
- Nonaxiomatizability of predicate logics of proofs (Q1406443) (← links)
- (Q2753697) (← links)
- Proof Systems for Effectively Propositional Logic (Q3541721) (← links)
- (Q4250049) (← links)
- The complexity of the modal predicate logic of “true in every transitive model of ZF” (Q4382481) (← links)
- On Kripke-style Semantics for the Provability Logic of Gödel's Proof Predicate with Quantifiers on Proofs (Q5696307) (← links)
- Effect polymorphism in higher-order logic (proof pearl) (Q5915785) (← links)