default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlbert Visser
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j62]Albert Visser:
Essential hereditary undecidability. Arch. Math. Log. 63(5-6): 529-562 (2024)- [j61]Juvenal Murwanashyaka, Fedor Pakhomov, Albert Visser:
There are no minimal essentially undecidable theories. J. Log. Comput. 34(6): 1159-1171 (2024) - [i3]Albert Visser, Tadeusz Litak:
Lewis and Brouwer meet Strong L\"ob. CoRR abs/2404.11969 (2024) - 2023
- [j60]Balthasar Grabmayr, Albert Visser:
Self-Reference Upfront: a Study of Self-Referential Gödel Numberings. Rev. Symb. Log. 16(2): 385-424 (2023) - 2022
- [j59]Taishi Kurahashi
, Yuya Okawa, V. Yu. Shavrukov, Albert Visser:
On Guaspari's problem about partially conservative sentences. Ann. Pure Appl. Log. 173(5): 103087 (2022) - [j58]Albert Visser:
Friedman-reflexivity. Ann. Pure Appl. Log. 173(9): 103160 (2022) - 2021
- [j57]Albert Visser:
The absorption law. Arch. Math. Log. 60(3-4): 441-468 (2021) - [j56]Albert Visser:
Enayat Theories. FLAP 8(7): 2073-2118 (2021) - 2020
- [j55]Albert Visser:
Another Look at the second Incompleteness Theorem. Rev. Symb. Log. 13(2): 269-295 (2020)
2010 – 2019
- 2019
- [j54]Albert Visser, Jetze Zoethout:
Provability logic and the completeness principle. Ann. Pure Appl. Log. 170(6): 718-753 (2019) - [j53]Fedor Pakhomov, Albert Visser:
On a Question of Krajewski's. J. Symb. Log. 84(1): 343-358 (2019) - [j52]Albert Visser:
From Tarski to Gödel - or how to derive the second incompleteness theorem from the undefinability of truth without self-reference. J. Log. Comput. 29(5): 595-604 (2019) - [j51]Albert Visser:
The small-is-very-small principle. Math. Log. Q. 65(4): 453-478 (2019) - [i2]Tadeusz Litak, Albert Visser:
Lewisian Fixed Points I: Two Incomparable Constructions. CoRR abs/1905.09450 (2019) - 2017
- [j50]Paula Henk, Albert Visser:
Interpretability suprema in Peano Arithmetic. Arch. Math. Log. 56(5-6): 555-584 (2017) - [j49]Albert Visser:
On Q. Soft Comput. 21(1): 39-56 (2017) - [i1]Tadeusz Litak, Albert Visser:
Lewis meets Brouwer: constructive strict implication. CoRR abs/1708.02143 (2017) - 2016
- [j48]Albert Visser:
Transductions in arithmetic. Ann. Pure Appl. Log. 167(3): 211-234 (2016) - 2015
- [j47]Albert Visser:
The Arithmetics of a Theory. Notre Dame J. Formal Log. 56(1): 81-119 (2015) - 2014
- [j46]Albert Visser:
Interpretability degrees of finitely axiomatized sequential theories. Arch. Math. Log. 53(1-2): 23-42 (2014) - [j45]Albert Visser:
Peano Corto and Peano Basso: A Study of Local Induction in the Context of Weak Theories. Math. Log. Q. 60(1-2): 92-117 (2014) - [j44]V. Yu. Shavrukov, Albert Visser:
Uniform Density in Lindenbaum Algebras. Notre Dame J. Formal Log. 55(4): 569-582 (2014) - [j43]Volker Halbach, Albert Visser:
Self-Reference in Arithmetic I. Rev. Symb. Log. 7(4): 671-691 (2014) - [j42]Volker Halbach, Albert Visser:
Self-Reference in Arithmetic II. Rev. Symb. Log. 7(4): 692-712 (2014) - 2012
- [j41]Albert Visser:
Vaught's Theorem on Axiomatizability by a Scheme. Bull. Symb. Log. 18(3): 382-402 (2012) - [j40]Albert Visser:
A Tractarian Universe. J. Philos. Log. 41(3): 519-545 (2012) - [j39]Albert Visser:
The Second Incompleteness Theorem and Bounded Interpretations. Stud Logica 100(1-2): 399-418 (2012) - 2011
- [j38]Dick de Jongh, Rineke Verbrugge, Albert Visser:
Intermediate Logics and the de Jongh property. Arch. Math. Log. 50(1-2): 197-213 (2011) - [j37]Sergei I. Adian, Lev D. Beklemishev, Albert Visser:
Proof and Computation. J. Log. Comput. 21(4): 541-542 (2011) - [j36]Albert Visser:
Can We Make the Second Incompleteness Theorem Coordinate Free? J. Log. Comput. 21(4): 543-560 (2011) - [j35]Albert Visser:
Hume's Principle, Beginnings. Rev. Symb. Log. 4(1): 114-129 (2011) - [j34]Clemens Grabmayer, Joop Leo, Vincent van Oostrom, Albert Visser:
On the Termination of Russell's Description Elimination Algorithm. Rev. Symb. Log. 4(3): 367-393 (2011) - [j33]Albert Visser:
On the ambiguation of Polish notation. Theor. Comput. Sci. 412(28): 3404-3411 (2011)
2000 – 2009
- 2009
- [j32]Albert Visser:
The predicative Frege hierarchy. Ann. Pure Appl. Log. 160(2): 129-153 (2009) - [j31]Albert Visser:
Growing Commas. A Study of Sequentiality and Concatenation. Notre Dame J. Formal Log. 50(1): 61-85 (2009) - [j30]Albert Visser:
Cardinal Arithmetic in the Style of Baron von MüNchhausen. Rev. Symb. Log. 2(3): 570-589 (2009) - 2008
- [j29]Albert Visser:
Pairs, sets and sequences in first-order theories. Arch. Math. Log. 47(4): 299-326 (2008) - [j28]Albert Visser:
Closed fragments of provability logics of constructive theories. J. Symb. Log. 73(3): 1081-1096 (2008) - 2006
- [j27]Albert Visser, Maartje de Jonge:
No Escape from Vardanyan's theorem. Arch. Math. Log. 45(5): 539-554 (2006) - [j26]Albert Visser:
Predicate logics of constructive arithmetical theories. J. Symb. Log. 71(4): 1311-1326 (2006) - [j25]Albert Visser:
Propositional Logics of Closed and Open Substitutions over Heyting's Arithmetic. Notre Dame J. Formal Log. 47(3): 299-309 (2006) - 2005
- [j24]Albert Visser:
Faith & falsity. Ann. Pure Appl. Log. 131(1-3): 103-131 (2005) - [j23]Lev D. Beklemishev, Albert Visser:
On the limit existence principles in elementary arithmetic and Sigma n 0-consequences of theories. Ann. Pure Appl. Log. 136(1-2): 56-74 (2005) - [c2]Albert Visser:
Löb's Logic Meets the µ-Calculus. Processes, Terms and Cycles 2005: 14-25 - 2002
- [j22]Giovanna D'Agostino, Albert Visser:
Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Log. 41(3): 267-298 (2002) - [j21]Albert Visser:
Substitutions of Sigma10 - sentences: explorations between intuitionistic propositional logic and intuitionistic arithmetic. Ann. Pure Appl. Log. 114(1-3): 227-271 (2002) - [j20]Albert Visser:
The Donkey and the Monoid. Dynamic Semantics with Control Elements. J. Log. Lang. Inf. 11(1): 107-131 (2002) - 2001
- [j19]Albert Visser:
Submodels of Kripke models. Arch. Math. Log. 40(4): 277-295 (2001)
1990 – 1999
- 1999
- [j18]Marco Hollenberg, Albert Visser:
Dynamic Negation, the One and Only. J. Log. Lang. Inf. 8(2): 137-141 (1999) - [j17]Albert Visser:
Rules and Arithmetics. Notre Dame J. Formal Log. 40(1): 116-140 (1999) - 1998
- [j16]Albert Visser:
Contexts in Dynamic Predicate Logic. J. Log. Lang. Inf. 7(1): 21-52 (1998) - 1997
- [j15]Albert Visser:
Dynamic Relation Logic Is the Logic of DPL-Relations. J. Log. Lang. Inf. 6(4): 441-452 (1997) - [p1]Reinhard Muskens, Johan van Benthem, Albert Visser:
Dynamics. Handbook of Logic and Language 1997: 587-648 - 1996
- [j14]Albert Visser, Kees Vermeulen:
Dynamic Bracketing and Discourse Representation. Notre Dame J. Formal Log. 37(2): 321-365 (1996) - [c1]Albert Visser:
An Overview of Interpretability Logic. Advances in Modal Logic 1996: 307-359 - 1995
- [j13]Albert Visser:
A Course on Bimodal Provability Logic. Ann. Pure Appl. Log. 73(1): 109-142 (1995) - [j12]Sergei N. Artëmov, George Boolos, Erwin Engeler, Solomon Feferman, Gerhard Jäger, Albert Visser:
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. 75(1-2): 1 (1995) - 1994
- [j11]Rineke Verbrugge, Albert Visser:
A Small Reflection Principle for Bounded Arithmetic. J. Symb. Log. 59(3): 785-812 (1994) - 1993
- [j10]Albert Visser:
The unprovability of small inconsistency - A study of local and global interpretability. Arch. Math. Log. 32(4): 275-298 (1993) - 1992
- [j9]Albert Visser:
An Inside View of EXP; or, The Closed Fragment of the Provability Logic of I Delta0+Omega1 with a Propositional Constant for EXP. J. Symb. Log. 57(1): 131-165 (1992) - 1991
- [j8]Albert Visser:
On the Σ10-Conservativity of Σ10-Completeness. Notre Dame J. Formal Log. 32(4): 554-561 (1991) - [j7]Dick de Jongh, Albert Visser:
Explicit Fixed Points in Interpretability Logic. Stud Logica 50(1): 39-49 (1991) - [j6]Albert Visser:
The formalization of Interpretability. Stud Logica 50(1): 81-105 (1991)
1980 – 1989
- 1989
- [j5]Albert Visser:
Peano's Smart Children: A Provability Logical Study of Systems with Built-in Consistency. Notre Dame J. Formal Log. 30(2): 161-196 (1989) - 1986
- [j4]Erik C. W. Krabbe, Hans Mulder, Albert Visser, Dirk van Dalen:
Finite Kripke models of HA are locally PA. Notre Dame J. Formal Log. 27(4): 528-532 (1986) - 1984
- [j3]Albert Visser:
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic. J. Philos. Log. 13(1): 97-113 (1984) - [j2]Albert Visser:
Four valued semantics and the Liar. J. Philos. Log. 13(2): 181-212 (1984) - 1982
- [j1]Albert Visser:
On the completenes principle: A study of provability in heyting's arithmetic and extensions. Ann. Math. Log. 22(3): 263-295 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
