-
37Completeness and Decidability of General First-Order LogicJournal of Philosophical Logic 46 (3): 233-257. 2017.This paper investigates the “general” semantics for first-order logic introduced to Antonelli, 637–58, 2013): a sound and complete axiom system is given, and the satisfiability problem for the general semantics is reduced to the satisfiability of formulas in the Guarded Fragment of Andréka et al. :217–274, 1998), thereby showing the former decidable. A truth-tree method is presented in the Appendix.
-
33Review: Dov M. Gabbay, C. J. Hogger, J. A. Robinson, D. Nute, Handbook of Logic in Artificial Intelligence and Logic Programming, Volume 3, Nonmonotonic Reasoning and Uncertain Reasoning (review)Bulletin of Symbolic Logic 6 (4): 480-484. 2000.
-
31Revision Rules: An Investigation into Non-Monotonic Inductive DefinitionsDissertation, University of Pittsburgh. 1992.Many different modes of definition have been proposed over time, but none of them allows for circular definitions, since, according to the prevalent view, the term defined would then be lacking a precise signification. I argue that although circular definitions may at times fail uniquely to pick out a concept or an object, sense still can be made of them by using a rule of revision in the style adopted by Anil Gupta and Nuel Belnap in the theory of truth.
-
27A directly cautious theory of defeasible consequence for default logic via the notion of general extensionArtificial Intelligence 109 (1-2): 71-109. 1999.This paper introduces a generalization of Reiter’s notion of “extension” for default logic. The main difference from the original version mainly lies in the way conflicts among defaults are handled: in particular, this notion of “general extension” allows defaults not explicitly triggered to pre-empt other defaults. A consequence of the adoption of such a notion of extension is that the collection of all the general extensions of a default theory turns out to have a nontrivial algebraic structure…Read more
-
26University of California at Berkeley Berkeley, CA, USA March 24–27, 2011Bulletin of Symbolic Logic 18 (2). 2012.
-
26LogicIn Luciano Floridi (ed.), The Blackwell Guide to the Philosophy of Computing and Information, Blackwell. 2004.Logic is an ancient discipline that, ever since its inception some 2500 years ago, has been concerned with the analysis of patterns of valid reasoning. Aristotle first developed the theory of the syllogism (a valid argument form involving predicates and quantifiers), and later the Stoics singled out patterns of propositional argumentation (involving sentential connectives). The study of logic flourished in ancient times and during the middle ages, when logic was regarded, together with grammar and …Read more
-
22In the light of logic, by Solomon Feferman, Logic and computation in philosophy, Oxford University Press, New York, Oxford, etc., 1998, xii + 340 pp (review)Bulletin of Symbolic Logic 7 (2): 270-277. 2001.
-
20Patricia A. Blanchette. Frege's conception of logic. Oxford University Press, 2012. xv + 190 pp (review)Bulletin of Symbolic Logic 19 (2): 219-222. 2013.
-
17Proto-Semantics for Positive Free LogicJournal of Philosophical Logic 29 (3): 277-294. 2000.This paper presents a bivalent extensional semantics for positive free logic without resorting to the philosophically questionable device of using models endowed with a separate domain of “non-existing” objects. The models here introduced have only one (possibly empty) domain, and a partial reference function for the singular terms (that might be undefined at some arguments). Such an approach provides a solution to an open problem put forward by Lambert, and can be viewed as supplying a version …Read more
-
17Due programmi diversi si intersecano nel lavoro di Frege sui fondamenti dell’aritmetica: • Logicismo: l’aritmetica `e riducibile alla logica; • Estensionalismo: l’aritmetica `e riducibile a una teoria delle estensioni. Sia nei Fondamenti che nei Principi, Frege articola l’idea che l’aritmetica sia riducibile a una teoria logica delle estensioni
-
15Gödel, Penrose, e i fondamenti dell'intelligenza artificialeSistemi Intelligenti 9 (3): 353-376. 1997.Il dibattito sul ruolo e le implicazioni del teorema di Gödel per l'intelligenza artificiale ha recentemente ricevuto nuovo impeto grazie a due importanti volumi pubblicati da Roger Penrose, The Emperor's New Mind [1989] e Shadows of the Mind [1994]. Naturalmente, Penrose non è il primo né l'ultimo a usare il teorema di Gödel allo scopo di trarne conseguenze per i fondamenti dell'intelligenza artificiale. Tuttavia il recente dibattito suscitato dai due libri di Penrose è significativo sia per am…Read more
-
10Virtuous CirclesIn Anil Gupta & Andre Chapuis (eds.), Circularity, Definition, and Truth, Indian Council of Philosophical Research. 2000.In the Posterior Analytics, Aristotle takes up the position of those who hold that all knowledge is demonstrable, and, hence, scientific. Such people are said to base their arguments on the fact that some demonstrations are circular or reciprocal (72b251). As Aristotle makes clear in the text, a circular demonstration consists of an argument (form) in which the conclusion is equivalent to one of the premises. But as Aristotle hastens to point out, demonstrations cannot be circular, for the essenc…Read more
-
10Semantic Nominalism: How I Learned to Stop Worrying and Love UniversalsIn Francesca Boccuni & Andrea Sereni (eds.), Objectivity, Realism, and Proof. FilMat Studies in the Philosophy of Mathematics, Springer International Publishing. 2016.Aldo Antonelli offers a novel view on abstraction principles in order to solve a traditional tension between different requirements: that the claims of science be taken at face value, even when involving putative reference to mathematical entities; and that referents of mathematical terms are identified and their possible relations to other objects specified. In his view, abstraction principles provide representatives for equivalence classes of second-order entities that are available provided t…Read more
-
7
-
7Defeasible Reasoning as a Cognitive ModelIn Krister Segerberg (ed.), The Parikh Project. Seven Papers in Honour of Rohit, Uppsala Prints & Preprints in Philosophy. 1996.One of the most important developments over the last twenty years both in logic and in Artificial Intelligence is the emergence of so-called non-monotonic logics. These logics were initially developed by McCarthy [10], McDermott & Doyle [13], and Reiter [17]. Part of the original motivation was to provide a formal framework within which to model cognitive phenomena such as defeasible inference and defeasible knowledge representation, i.e., to provide a formal account of the fact that reasoners ca…Read more
-
7Kleene comincia la sezione §60 di Introduction to metamathematics considerando la questione se la matematica informale, e specialmente la teoria intuitiva dei numeri sia formalizzabile. Il classico teorema di G¨
-
6With the aid of a non-standard (but still first-order) cardinality quantifier and an extra-logical operator representing numerical abstraction, this paper presents a formalization of first-order arithmetic, in which numbers are abstracta of the equinumerosity relation, their properties derived from those of the cardinality quantifier and the abstraction operator.
-
5Free Set Algebras Satisfying Systems of EquationsJournal of Symbolic Logic 64 (4): 1656-1674. 1999.In this paper we introduce the notion of a set algebra $\mathscr{S}$ satisfying a system $\mathscr{E}$ equations. After defining a notion of freeness for such algebras, we show that, for any system $\mathscr{E}$ of equations, set algebras that are free in the class of structures satisfying $\mathscr{E}$ exist and are unique up to a bisimulation. Along the way, analogues of classical set-theoretic and algebraic properties are investigated.
-
4Book review (review)Grazer Philosophische Studien 60 (1): 217-28. 2000.Like Elvis, logical empiricism has been officially dead for decades. But just like Elvis, it stubbornly keeps resurfacing at one juncture or another in our philosophical landscape. In fact, the more the main characters of logical empiricism recede in the distance, the more frequently they reappear, to the point that it’s fair to say that we are witnessing a veritable renaissance in studies leading to the historical appraisal of the import and influence of the logical empiricist movement.
-
2Book review To appear in the Bulletin of Symbolic Logic (review)Bulletin of Symbolic Logic 6 (4): 480-84. 2000.The emergence, over the last twenty years or so, of so-called “non-monotonic” logics represents one of the most significant developments both in logic and artificial intelligence. These logics were devised in order to represent defeasible reasoning, i.e., that kind of inference in which reasoners draw conclusions tentatively, reserving the right to retract them in the light of further evidence
-
2Extensional Quotients for Type Theory and the Consistency Problem for NFJournal of Symbolic Logic 63 (1): 247-261. 1998.
-
1Virtuous circles: From fixed points to revision rulesIn Anil Gupta & Andre Chapuis (eds.), Circularity, Definition, and Truth, Indian Council of Philosophical Research. pp. 1--27. 2000.
-
Non-monotonic LogicIn Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy, The Metaphysics Research Lab. 2014.
Davis, California, United States of America
Areas of Specialization
Philosophy of Language |
Logic and Philosophy of Logic |
Philosophy of Mathematics |
Areas of Interest
Philosophy of Cognitive Science |
General Philosophy of Science |