default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGian Aldo Antonelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j19]Aldo Antonelli:
Completeness and Decidability of General First-Order Logic (with a Detour Through the Guarded Fragment). J. Philos. Log. 46(3): 233-257 (2017)- 2013
- [j18]Gian Aldo Antonelli:
On the General Interpretation of First-order Quantifiers. Rev. Symb. Log. 6(4): 637-658 (2013) - 2012
- [j17]Gian Aldo Antonelli:
A Note on Induction, Abstraction, and Dedekind-Finiteness. Notre Dame J. Formal Log. 53(2): 187-192 (2012) - 2010
- [j16]Gian Aldo Antonelli:
Numerical Abstraction via the Frege Quantifier. Notre Dame J. Formal Log. 51(2): 161-179 (2010)
2000 – 2009
- 2008
- [j15]Aldo Antonelli, Alasdair Urquhart, Richard Zach
:
Mathematical Methods in Philosophy Editors' Introduction. Rev. Symb. Log. 1(2): 143-145 (2008) - 2005
- [j14]Aldo Antonelli, Robert May:
Frege's Other Program. Notre Dame J. Formal Log. 46(1): 1-17 (2005) - 2002
- [j13]Gian Aldo Antonelli, Richmond H. Thomason:
Representability in Second-Order Propositional Poly-Modal Logic. J. Symb. Log. 67(3): 1039-1054 (2002) - [j12]Gian Aldo Antonelli:
The Complexity of Revision, Revised. Notre Dame J. Formal Log. 43(2): 75-78 (2002) - 2000
- [j11]Gian Aldo Antonelli:
Proto-Semantics for Positive Free Logic. J. Philos. Log. 29(3): 277-294 (2000) - [j10]Aldo Antonelli, Robert May:
Frege's New Science. Notre Dame J. Formal Log. 41(3): 242-270 (2000)
1990 – 1999
- 1999
- [j9]Gian Aldo Antonelli:
A Directly Cautious Theory of Defeasible Consequence for Default Logic via the Notion of General Extension. Artif. Intell. 109(1-2): 71-109 (1999) - [j8]Gian Aldo Antonelli:
Free Set Algebras Satisfying Systems of Equations. J. Symb. Log. 64(4): 1656-1674 (1999) - 1998
- [j7]Gian Aldo Antonelli:
Extensional Quotients for Type Theory and the Consistency Property for NF. J. Symb. Log. 63(1): 247-261 (1998) - 1997
- [j6]Gian Aldo Antonelli:
Defeasible Inheritance on Cyclic Networks. Artif. Intell. 92(1-2): 1-12 (1997) - 1996
- [j5]Gian Aldo Antonelli:
What's in a function? Synth. 107(2): 167-204 (1996) - 1995
- [j4]Cristina Bicchieri, Gian Aldo Antonelli:
Game-Theoretic Axioms for Local Rationality and Bounded Knowledge. J. Log. Lang. Inf. 4(2): 145-167 (1995) - [c2]Cristina Bicchieri, Eithan Ephrati, Gian Aldo Antonelli:
Games Servers Play: A Procedural Approach. ATAL 1995: 127-142 - 1994
- [j3]Gian Aldo Antonelli:
Non-well-founded sets via revision rules. J. Philos. Log. 23(6): 633-679 (1994) - [j2]Gian Aldo Antonelli:
The Complexity of Revision. Notre Dame J. Formal Log. 35(1): 67-72 (1994) - [j1]Gian Aldo Antonelli:
A Revision-Theoretic Analysis of the Arithmetical Hierarchy. Notre Dame J. Formal Log. 35(2): 204-218 (1994) - [c1]Gian Aldo Antonelli, Cristina Bicchieri:
Backwards Forward Induction. TARK 1994: 24-43
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-24 23:21 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:
