Albert Visser

Orcid: 0000-0001-9452-278X

According to our database1, Albert Visser authored at least 67 papers between 1982 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Essential hereditary undecidability.
Arch. Math. Log., July, 2024

Lewis and Brouwer meet Strong L\"ob.
CoRR, 2024

2023
Self-Reference Upfront: a Study of Self-Referential Gödel Numberings.
Rev. Symb. Log., June, 2023

2022
Friedman-reflexivity.
Ann. Pure Appl. Log., 2022

On Guaspari's problem about partially conservative sentences.
Ann. Pure Appl. Log., 2022

2021
Enayat Theories.
FLAP, 2021

The absorption law.
Arch. Math. Log., 2021

2020
Another Look at the second Incompleteness Theorem.
Rev. Symb. Log., 2020

2019
The small-is-very-small principle.
Math. Log. Q., 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

On a Question of Krajewski's.
J. Symb. Log., 2019

Lewisian Fixed Points I: Two Incomparable Constructions.
CoRR, 2019

Provability logic and the completeness principle.
Ann. Pure Appl. Log., 2019

2017
Soft Comput., 2017

Lewis meets Brouwer: constructive strict implication.
CoRR, 2017

Interpretability suprema in Peano Arithmetic.
Arch. Math. Log., 2017

2016
Transductions in arithmetic.
Ann. Pure Appl. Log., 2016

2015
The Arithmetics of a Theory.
Notre Dame J. Formal Log., 2015

2014
Self-Reference in Arithmetic II.
Rev. Symb. Log., 2014

Self-Reference in Arithmetic I.
Rev. Symb. Log., 2014

Uniform Density in Lindenbaum Algebras.
Notre Dame J. Formal Log., 2014

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

Interpretability degrees of finitely axiomatized sequential theories.
Arch. Math. Log., 2014

2012
The Second Incompleteness Theorem and Bounded Interpretations.
Stud Logica, 2012

A Tractarian Universe.
J. Philos. Log., 2012

Vaught's Theorem on Axiomatizability by a Scheme.
Bull. Symb. Log., 2012

2011
On the ambiguation of Polish notation.
Theor. Comput. Sci., 2011

Hume's Principle, Beginnings.
Rev. Symb. Log., 2011

On the Termination of Russell's Description Elimination Algorithm.
Rev. Symb. Log., 2011

Can We Make the Second Incompleteness Theorem Coordinate Free?
J. Log. Comput., 2011

Proof and Computation.
J. Log. Comput., 2011

Intermediate Logics and the de Jongh property.
Arch. Math. Log., 2011

2009
Cardinal Arithmetic in the Style of Baron von MüNchhausen.
Rev. Symb. Log., 2009

Growing Commas. A Study of Sequentiality and Concatenation.
Notre Dame J. Formal Log., 2009

The predicative Frege hierarchy.
Ann. Pure Appl. Log., 2009

2008
Closed fragments of provability logics of constructive theories.
J. Symb. Log., 2008

Pairs, sets and sequences in first-order theories.
Arch. Math. Log., 2008

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

Predicate logics of constructive arithmetical theories.
J. Symb. Log., 2006

No Escape from Vardanyan's theorem.
Arch. Math. Log., 2006

2005
Faith & falsity.
Ann. Pure Appl. Log., 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

Löb's Logic Meets the µ-Calculus.
Proceedings of the Processes, 2005

2002
The Donkey and the Monoid. Dynamic Semantics with Control Elements.
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

Finality regained: A coalgebraic study of Scott-sets and multisets.
Arch. Math. Log., 2002

2001
Submodels of Kripke models.
Arch. Math. Log., 2001

1999
Rules and Arithmetics.
Notre Dame J. Formal Log., 1999

Dynamic Negation, the One and Only.
J. Log. Lang. Inf., 1999

1998
Contexts in Dynamic Predicate Logic.
J. Log. Lang. Inf., 1998

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

Dynamics.
Proceedings of the Handbook of Logic and Language., 1997

1996
Dynamic Bracketing and Discourse Representation.
Notre Dame J. Formal Log., 1996

An Overview of Interpretability Logic.
Proceedings of the Advances in Modal Logic 1, 1996

1995
A Course on Bimodal Provability Logic.
Ann. Pure Appl. Log., 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
A Small Reflection Principle for Bounded Arithmetic.
J. Symb. Log., 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
The formalization of Interpretability.
Stud Logica, 1991

Explicit Fixed Points in Interpretability Logic.
Stud Logica, 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
Finite Kripke models of HA are locally PA.
Notre Dame J. Formal Log., 1986

1984
Four valued semantics and the Liar.
J. Philos. Log., 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


  Loading...