default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrea Cantini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j21]Andrea Cantini:
A fixed point theory over stratified truth. Math. Log. Q. 66(4): 380-394 (2020)
2010 – 2019
- 2014
- [c1]Matteo Pardini, Andrea Cantini, Florian Kugler, Konstantinos Papathanassiou, Fabrizio Lombardini:
Monitoring dynamics in time of forest vertical structure with multibaseline PolInSAR data. IGARSS 2014: 3366-3369 - 2011
- [j20]Andrea Cantini:
Extending constructive operational set theory by impredicative principles. Math. Log. Q. 57(3): 299-322 (2011)
2000 – 2009
- 2009
- [r1]Andrea Cantini:
Paradoxes, Self-Reference and Truth in the 20th Century. Logic from Russell to Church 2009: 875-1013 - 2005
- [j19]Andrea Cantini:
Remarks on applicative theories. Ann. Pure Appl. Log. 136(1-2): 91-115 (2005) - 2004
- [j18]Andrea Cantini, Valentin Goranko:
Nicholas Rescher, "Paradoxes: Their Roots, Range, and Resolution"; Patrick Blackburn, Maarten de Rijke and Yde Venema, "Modal Logic", Cambridge Tracts in Theoretical Computer Science Volume 53. Stud Logica 76(1): 135-142 (2004) - 2003
- [j17]Andrea Cantini:
The axiom of choice and combinatory logic. J. Symb. Log. 68(4): 1091-1108 (2003) - [j16]Andrea Cantini:
The Undecidability of Grisin's Set Theory. Stud Logica 74(3): 345-368 (2003) - 2002
- [j15]Andrea Cantini:
Polytime, combinatory logic and positive safe induction. Arch. Math. Log. 41(2): 169-189 (2002) - 2000
- [j14]Andrea Cantini:
Feasible Operations and Applicative Theories Based on lambda-eta. Math. Log. Q. 46(3): 291-312 (2000)
1990 – 1999
- 1999
- [j13]Andrea Cantini, Pierluigi Minari:
Uniform Inseparability in Explicit Mathematics. J. Symb. Log. 64(1): 313-326 (1999) - [j12]Andrea Cantini:
Relating Quine's NF to Feferman's EM. Stud Logica 62(2): 141-162 (1999) - 1996
- [b1]Andrea Cantini:
Logical frameworks for truth and abstraction - an axiomatic study. Studies in logic and the foundations of mathematics 135, Elsevier 1996, ISBN 978-0-444-82306-9, pp. I-XII, 1-461 - [j11]Andrea Cantini:
Asymmetric Interpretations for Bounded Theories. Math. Log. Q. 42: 270-288 (1996) - 1995
- [j10]Andrea Cantini:
Levels of Truth. Notre Dame J. Formal Log. 36(2): 185-213 (1995) - 1993
- [j9]Andrea Cantini:
Extending the First-Order Theory of Combinators with Self-Referential Truth. J. Symb. Log. 58(2): 477-513 (1993) - 1992
- [j8]Andrea Cantini:
Levels of Implication and Type Free Theories of Classifications with Approximation Operator. Math. Log. Q. 38(1): 107-141 (1992) - 1991
- [j7]Andrea Cantini:
A logic of abstraction related to finite constructive number classes. Arch. Math. Log. 31(1): 69-83 (1991) - 1990
- [j6]Andrea Cantini:
A Theory of Formal Truth Arithmetically Equivalent to ID1. J. Symb. Log. 55(1): 244-259 (1990)
1980 – 1989
- 1989
- [j5]Andrea Cantini:
Notes on Formal Theories of Truth. Math. Log. Q. 35(2): 97-130 (1989) - 1988
- [j4]Andrea Cantini:
Two Impredicative Theories of Properties and Sets. Math. Log. Q. 34(5): 403-420 (1988) - 1986
- [j3]Andrea Cantini:
On the Relation Between Choice and Comprehension Principles in Second Order Arithmetic. J. Symb. Log. 51(2): 360-373 (1986) - 1985
- [j2]Andrea Cantini:
Majorizing provably recursive functions in fragments of PA. Arch. Math. Log. 25(1): 21-31 (1985) - [j1]Andrea Cantini:
On Weak Theories of Sets and Classes which are Based on Strict ∏. Math. Log. Q. 31(21-23): 321-332 (1985)
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-04-25 05:57 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:
