On the completenes principle: A study of provability in heyting's arithmetic and extensions. - Albert Visser (Ann. Math. Log., 1982)

The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic. - Albert Visser (J. Philos. Log., 1984)

Four valued semantics and the Liar. - Albert Visser (J. Philos. Log., 1984)

Finite Kripke models of HA are locally PA. - Erik C. W. Krabbe; Hans Mulder; Albert Visser; Dirk van Dalen (Notre Dame J. Formal Log., 1986)

Peano's Smart Children: A Provability Logical Study of Systems with Built-in Consistency. - Albert Visser (Notre Dame J. Formal Log., 1989)

On the Σ10-Conservativity of Σ10-Completeness. - Albert Visser (Notre Dame J. Formal Log., 1991)

Explicit Fixed Points in Interpretability Logic. - Dick de Jongh; Albert Visser (Stud Logica, 1991)

The formalization of Interpretability. - Albert Visser (Stud Logica, 1991)

An Inside View of EXP; or, The Closed Fragment of the Provability Logic of I Delta0+Omega1 with a Propositional Constant for EXP. - Albert Visser (J. Symb. Log., 1992)

The unprovability of small inconsistency - A study of local and global interpretability. - Albert Visser (Arch. Math. Log., 1993)

A Small Reflection Principle for Bounded Arithmetic. - Rineke Verbrugge; Albert Visser (J. Symb. Log., 1994)

Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994. - Sergei N. Artëmov; George Boolos; Erwin Engeler; Solomon Feferman; Gerhard Jäger; Albert Visser (Ann. Pure Appl. Log., 1995)

A Course on Bimodal Provability Logic. - Albert Visser (Ann. Pure Appl. Log., 1995)

An Overview of Interpretability Logic. - Albert Visser (Advances in Modal Logic, 1996)

Dynamic Bracketing and Discourse Representation. - Albert Visser; Kees Vermeulen (Notre Dame J. Formal Log., 1996)

Dynamics. - Reinhard Muskens; Johan van Benthem; Albert Visser (Handbook of Logic and Language, 1997)

Dynamic Relation Logic Is the Logic of DPL-Relations. - Albert Visser (J. Log. Lang. Inf., 1997)

Contexts in Dynamic Predicate Logic. - Albert Visser (J. Log. Lang. Inf., 1998)

Dynamic Negation, the One and Only. - Marco Hollenberg; Albert Visser (J. Log. Lang. Inf., 1999)

Rules and Arithmetics. - Albert Visser (Notre Dame J. Formal Log., 1999)

Submodels of Kripke models. - Albert Visser (Arch. Math. Log., 2001)

Finality regained: A coalgebraic study of Scott-sets and multisets. - Giovanna D'Agostino; Albert Visser (Arch. Math. Log., 2002)

Substitutions of Sigma10 - sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic. - Albert Visser (Ann. Pure Appl. Log., 2002)

The Donkey and the Monoid. Dynamic Semantics with Control Elements. - Albert Visser (J. Log. Lang. Inf., 2002)

Löb's Logic Meets the µ-Calculus. - Albert Visser (Processes, Terms and Cycles, 2005)

On the limit existence principles in elementary arithmetic and Sigma n 0-consequences of theories. - Lev D. Beklemishev; Albert Visser (Ann. Pure Appl. Log., 2005)

Faith & falsity. - Albert Visser (Ann. Pure Appl. Log., 2005)

No Escape from Vardanyan's theorem. - Albert Visser; Maartje de Jonge (Arch. Math. Log., 2006)

Predicate logics of constructive arithmetical theories. - Albert Visser (J. Symb. Log., 2006)

Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic. - Albert Visser (Notre Dame J. Formal Log., 2006)

Pairs, sets and sequences in first-order theories. - Albert Visser (Arch. Math. Log., 2008)

Closed fragments of provability logics of constructive theories. - Albert Visser (J. Symb. Log., 2008)

The predicative Frege hierarchy. - Albert Visser (Ann. Pure Appl. Log., 2009)

Growing Commas. A Study of Sequentiality and Concatenation. - Albert Visser (Notre Dame J. Formal Log., 2009)

Cardinal Arithmetic in the Style of Baron von MüNchhausen. - Albert Visser (Rev. Symb. Log., 2009)

Intermediate Logics and the de Jongh property. - Dick de Jongh; Rineke Verbrugge; Albert Visser (Arch. Math. Log., 2011)

Proof and Computation. - Sergei I. Adian; Lev D. Beklemishev; Albert Visser (J. Log. Comput., 2011)

Can We Make the Second Incompleteness Theorem Coordinate Free? - Albert Visser (J. Log. Comput., 2011)

On the Termination of Russell's Description Elimination Algorithm. - Clemens Grabmayer; Joop Leo; Vincent van Oostrom; Albert Visser (Rev. Symb. Log., 2011)

Hume's Principle, Beginnings. - Albert Visser (Rev. Symb. Log., 2011)

On the ambiguation of Polish notation. - Albert Visser (Theor. Comput. Sci., 2011)

Vaught's Theorem on Axiomatizability by a Scheme. - Albert Visser (Bull. Symb. Log., 2012)

A Tractarian Universe. - Albert Visser (J. Philos. Log., 2012)

The Second Incompleteness Theorem and Bounded Interpretations. - Albert Visser (Stud Logica, 2012)

Interpretability degrees of finitely axiomatized sequential theories. - Albert Visser (Arch. Math. Log., 2014)

Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories. - Albert Visser (Math. Log. Q., 2014)

Uniform Density in Lindenbaum Algebras. - V. Yu. Shavrukov; Albert Visser (Notre Dame J. Formal Log., 2014)

Self-Reference in Arithmetic I. - Volker Halbach; Albert Visser (Rev. Symb. Log., 2014)

Self-Reference in Arithmetic II. - Volker Halbach; Albert Visser (Rev. Symb. Log., 2014)

The Arithmetics of a Theory. - Albert Visser (Notre Dame J. Formal Log., 2015)

Transductions in arithmetic. - Albert Visser (Ann. Pure Appl. Log., 2016)

Interpretability suprema in Peano Arithmetic. - Paula Henk; Albert Visser (Arch. Math. Log., 2017)

Lewis meets Brouwer: constructive strict implication. - Tadeusz Litak; Albert Visser (CoRR, 2017)

On Q. - Albert Visser (Soft Comput., 2017)

Provability logic and the completeness principle. - Albert Visser; Jetze Zoethout (Ann. Pure Appl. Log., 2019)

Lewisian Fixed Points I: Two Incomparable Constructions. - Tadeusz Litak; Albert Visser (CoRR, 2019)

On a Question of Krajewski's. - Fedor Pakhomov; Albert Visser (J. Symb. Log., 2019)

From Tarski to Gödel - or how to derive the second incompleteness theorem from the undefinability of truth without self-reference. - Albert Visser (J. Log. Comput., 2019)

The small-is-very-small principle. - Albert Visser (Math. Log. Q., 2019)

Another Look at the second Incompleteness Theorem. - Albert Visser (Rev. Symb. Log., 2020)

The absorption law. - Albert Visser (Arch. Math. Log., 2021)

Enayat Theories. - Albert Visser (FLAP, 2021)

On Guaspari's problem about partially conservative sentences. - Taishi Kurahashi; Yuya Okawa; V. Yu. Shavrukov; Albert Visser (Ann. Pure Appl. Log., 2022)

Friedman-reflexivity. - Albert Visser (Ann. Pure Appl. Log., 2022)

Self-Reference Upfront: a Study of Self-Referential Gödel Numberings. - Balthasar Grabmayr; Albert Visser (Rev. Symb. Log., 2023)

Pour-el's Landscape. - Taishi Kurahashi; Albert Visser (Bull. Symb. Log., 2024)

Lewis and Brouwer meet Strong L "ob. - Albert Visser; Tadeusz Litak (CoRR, 2024)

There are no minimal essentially undecidable theories. - Juvenal Murwanashyaka; Fedor Pakhomov; Albert Visser (J. Log. Comput., 2024)

Essential hereditary undecidability. - Albert Visser (Arch. Math. Log., 2024)