The following pages link to Albert Visser (Q190340):
Displaying 50 items.
- A Tractarian universe (Q452345) (← links)
- The second incompleteness theorem and bounded interpretations (Q454368) (← links)
- On the ambiguation of Polish notation (Q549208) (← links)
- Intermediate logics and the de Jongh property (Q627438) (← links)
- The unprovability of small inconsistency. A study of local and global interpretability (Q688510) (← links)
- Faith \& falsity (Q705533) (← links)
- Four valued semantics and the Liar (Q798313) (← links)
- Propositional logics of closed and open substitutions over Heyting's arithmetic (Q866492) (← links)
- Transductions in arithmetic (Q904144) (← links)
- Pairs, sets and sequences in first-order theories (Q943342) (← links)
- Growing commas. A study of sequentiality and concatenation (Q1038605) (← links)
- The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic (Q1068069) (← links)
- A propositional logic with explicit fixed points (Q1156789) (← links)
- Explicit fixed points in interpretability logic (Q1176094) (← links)
- The formalization of interpretability (Q1176098) (← links)
- On the \(\Sigma{}^ 0_ 1\)-conservativity of \(\Sigma{}^ 0_ 1\)- completeness (Q1182692) (← links)
- Peano's smart children: A provability logical study of systems with built-in consistency (Q1262309) (← links)
- Dynamic negation, the one and only (Q1288172) (← links)
- Dynamic relation logic is the logic of DPL-relations (Q1371314) (← links)
- Contexts in dynamic predicate logic (Q1384001) (← links)
- Finality regained: A coalgebraic study of Scott-sets and multisets (Q1407541) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- On \(\mathsf{Q}\) (Q1699730) (← links)
- Provability logic and the completeness principle (Q1740459) (← links)
- Dynamic bracketing and discourse representation (Q1815432) (← links)
- The interpretability logic of all reasonable arithmetical theories. The new conjecture (Q1840999) (← links)
- A course on bimodal provability logic (Q1891253) (← links)
- On Guaspari's problem about partially conservative sentences (Q2120971) (← links)
- Friedman-reflexivity (Q2159935) (← links)
- Uniform density in Lindenbaum algebras (Q2258545) (← links)
- The predicative Frege hierarchy (Q2271986) (← links)
- The arithmetics of a theory (Q2345393) (← links)
- Interpretability suprema in Peano arithmetic (Q2402961) (← links)
- Interpretability degrees of finitely axiomatized sequential theories (Q2436609) (← links)
- No escape from Vardanyan's theorem (Q2501168) (← links)
- On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories (Q2566065) (← links)
- Extension and interpretability (Q2658276) (← links)
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb (Q2663342) (← links)
- Vaught's Theorem on Axiomatizability by a Scheme (Q2915888) (← links)
- (Q2998377) (← links)
- HUME’S PRINCIPLE, BEGINNINGS (Q3006003) (← links)
- (Q3079690) (← links)
- Can We Make the Second Incompleteness Theorem Coordinate Free? (Q3094141) (← links)
- ON THE TERMINATION OF RUSSELL’S DESCRIPTION ELIMINATION ALGORITHM (Q3096819) (← links)
- (Q3118396) (← links)
- Predicate Logics of Constructive Arithmetical Theories (Q3416116) (← links)
- Henkin and the Suit (Q3454801) (← links)
- The Henkin Sentence (Q3454817) (← links)
- (Q3464615) (← links)
- Closed Fragments of Provability Logics of Constructive Theories (Q3617381) (← links)