The following pages link to (Q3760514):
Displaying 18 items.
- Franco Montagna's work on provability logic and many-valued logic (Q300553) (← links)
- A generalized notion of weak interpretability and the corresponding modal logic (Q685075) (← links)
- Decidable and enumerable predicate logics of provability (Q750418) (← links)
- Tractable fragments of Presburger arithmetic (Q814932) (← links)
- Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic (Q866557) (← links)
- Computations in fragments of intuitionistic propositional logic (Q1181713) (← links)
- Algebraization of quantifier logics, an introductory overview (Q1189899) (← links)
- Nonaxiomatizability of predicate logics of proofs (Q1406443) (← links)
- Arithmetical soundness and completeness for \(\Sigma_{2}\) numerations (Q1756596) (← links)
- On a Diophantine representation of the predicate of provability (Q2253864) (← links)
- European Summer Meeting of the Association for Symbolic Logic, Uppsala 1991 (Q3138023) (← links)
- Quantified propositional calculi and fragments of bounded arithmetic (Q3472099) (← links)
- The degree of the set of sentences of predicate provability logic that are true under every interpretation (Q3768873) (← links)
- Polynomially and superexponentially shorter proofs in fragments of arithmetic (Q4032866) (← links)
- (Q4263489) (← links)
- Predicative Fragments of Frege Arithmetic (Q4678937) (← links)
- (Q5208872) (← links)
- AN ESCAPE FROM VARDANYAN’S THEOREM (Q6140187) (← links)
