Albert Visser
Orcid: 0000-0001-9452-278X
According to our database1,
Albert Visser
authored at least 68 papers
between 1982 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
2023
Rev. Symb. Log., June, 2023
2022
Ann. Pure Appl. Log., 2022
2021
2020
2019
From Tarski to Gödel - or how to derive the second incompleteness theorem from the undefinability of truth without self-reference.
J. Log. Comput., 2019
2017
2016
2015
2014
Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories.
Math. Log. Q., 2014
Arch. Math. Log., 2014
2012
2011
Rev. Symb. Log., 2011
2009
Notre Dame J. Formal Log., 2009
2008
2006
Notre Dame J. Formal Log., 2006
2005
On the limit existence principles in elementary arithmetic and Sigma <sub>n</sub> <sup>0</sup>-consequences of theories.
Ann. Pure Appl. Log., 2005
2002
J. Log. Lang. Inf., 2002
Substitutions of Sigma<sub>1</sub><sup>0</sup> - sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic.
Ann. Pure Appl. Log., 2002
Arch. Math. Log., 2002
2001
1999
1998
1997
1996
An Overview of Interpretability Logic.
Proceedings of the Advances in Modal Logic 1, 1996
1995
Preface: Special Issue of Papers from the Conference on Proof Theory, Provability Logic, and Computation, Berne, Switzerland, 20-24 March 1994.
Ann. Pure Appl. Log., 1995
1994
1993
The unprovability of small inconsistency - A study of local and global interpretability.
Arch. Math. Log., 1993
1992
An Inside View of EXP; or, The Closed Fragment of the Provability Logic of I Delta<sub>0</sub>+Omega<sub>1</sub> with a Propositional Constant for EXP.
J. Symb. Log., 1992
1991
On the Σ<sub>1</sub><sup>0</sup>-Conservativity of Σ<sub>1</sub><sup>0</sup>-Completeness.
Notre Dame J. Formal Log., 1991
1989
Peano's Smart Children: A Provability Logical Study of Systems with Built-in Consistency.
Notre Dame J. Formal Log., 1989
1986
1984
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic.
J. Philos. Log., 1984
1982
On the completenes principle: A study of provability in heyting's arithmetic and extensions.
Ann. Math. Log., 1982