-
21Decidable Fragments of the Quantified Argument CalculusReview of Symbolic Logic 1-26. forthcoming.This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showi…Read more
-
17Timothy Williamson on thought experiments – an empirical worryBalkan Journal of Philosophy 4 (2): 179-184. 2012.The topic of this paper is Timothy Williamson’s understanding of the logical form of thought experiments as involving counterfactual conditionals which are true when their antecedent is impossible. At the same time, he sees the ability to handle counterfactuals as grounded in our everyday capacities. The aim of this paper is to drive a wedge, on empirical grounds, between our ordinary capacities and the counterfactuals which require an impossible antecedent.
-
25Translating a Suppes-Lemmon Style Natural Deduction into a Sequent CalculusEuropean Journal of Analytic Philosophy 11 (2): 79--88. 2015.This paper presents a straightforward procedure for translating a Suppes-Lemmon style natural deduction proof into an LK sequent calculus. In doing so, it illustrates a close connection between the two, and also provides an account of redundant steps in a natural deduction proof.
-
16Proof-Theoretic Analysis of the Logics of Agency: The Deliberative STITStudia Logica 109 (3): 473-507. 2020.A sequent calculus methodology for systems of agency based on branching-time frames with agents and choices is proposed, starting with a complete and cut-free system for multi-agent deliberative STIT; the methodology allows a transparent justification of the rules, good structural properties, analyticity, direct completeness and decidability proofs.
-
66Is, Ought, and CutJournal of Philosophical Logic 52 (4): 1149-1169. 2023.In this paper we use proof-theoretic methods, specifically sequent calculi, admissibility of cut within them and the resultant subformula property, to examine a range of philosophically-motivated deontic logics. We show that for all of those logics it is a (meta)theorem that the Special Hume Thesis holds, namely that no purely normative conclusion follows non-trivially from purely descriptive premises (nor vice versa). In addition to its interest on its own, this also illustrates one way in whic…Read more
-
33Completeness of the Quantified Argument Calculus on the Truth-Valuational ApproachIn Boran Berčić, Aleksandra Golubović & Majda Trobok (eds.), Human Rationality: Festschrift for Nenad Smokrović, Faculty of Humanities and Social Sciences, University of Rijeka. 2022.The Quantified Argument Calculus (Quarc) is a formal logic system, first developed by Hanoch Ben-Yami in (Ben-Yami 2014), and since then extended and applied by several authors. The aim of this paper is to further these contributions by, first, providing a philosophical motivation for the truth-valuational, substitutional approach of (Ben-Yami 2014) and defending it against a common objection, a topic also of interest beyond its specific application to Quarc. Second, we fill the formal lacunae l…Read more
-
35Abstract Forms of Quantification in the Quantified Argument CalculusReview of Symbolic Logic 16 (2): 449-479. 2023.The Quantified argument calculus (Quarc) has received a lot of attention recently as an interesting system of quantified logic which eschews the use of variables and unrestricted quantification, but nonetheless achieves results similar to the Predicate calculus (PC) by employing quantifiers applied directly to predicates instead. Despite this noted similarity, the issue of the relationship between Quarc and PC has so far not been definitively resolved. We address this question in the present pap…Read more
-
28Neutral Free Logic: Motivation, Proof Theory and ModelsJournal of Philosophical Logic 52 (2): 519-554. 2023.Free logics are a family of first-order logics which came about as a result of examining the existence assumptions of classical logic (Hintikka _The Journal of Philosophy_, _56_, 125–137 1959 ; Lambert _Notre Dame Journal of Formal Logic_, _8_, 133–144 1967, 1997, 2001 ). What those assumptions are varies, but the central ones are that (i) the domain of interpretation is not empty, (ii) every name denotes exactly one object in the domain and (iii) the quantifiers have existential import. Free lo…Read more
-
48A More Unified Approach to Free LogicsJournal of Philosophical Logic 50 (1): 117-148. 2020.Free logics is a family of first-order logics which came about as a result of examining the existence assumptions of classical logic. What those assumptions are varies, but the central ones are that the domain of interpretation is not empty, every name denotes exactly one object in the domain and the quantifiers have existential import. Free logics usually reject the claim that names need to denote in, and of the systems considered in this paper, the positive free logic concedes that some atomic…Read more
-
39Proof-theoretic analysis of the quantified argument calculusReview of Symbolic Logic 12 (4): 607-636. 2019.This article investigates the proof theory of the Quantified Argument Calculus as developed and systematically studied by Hanoch Ben-Yami [3, 4]. Ben-Yami makes use of natural deduction, we, however, have chosen a sequent calculus presentation, which allows for the proofs of a multitude of significant meta-theoretic results with minor modifications to the Gentzen’s original framework, i.e., LK. As will be made clear in course of the article LK-Quarc will enjoy cut elimination and its corollaries…Read more
-
19Free Logic and the Quantified Argument CalculusIn Gabriele Mras, Paul Weingartner & Bernhard Ritter (eds.), Philosophy of Logic and Mathematics: Proceedings of the 41st International Ludwig Wittgenstein Symposium, De Gruyter. pp. 105-116. 2019.
-
12Some Limitations on the Applications of Propositional LogicCroatian Journal of Philosophy 18 (3): 471-477. 2018.This paper introduces a logic game which can be used to demonstrate the working of Boolean connectives. The simplicity of the system turns out to lead to some interesting meta-theoretical properties, which themselves carry a philosophical import. After introducing the system, we demonstrate an interesting feature of it—that it, while being an accurate model of propositional logic Booleans, does not contain any tautologies nor contradictions. This result allows us to make explicit a limitation of…Read more
-
27Alternative Axiomatization for Logics of Agency in a G3 CalculusFoundations of Science 28 (1): 205-224. 2021.In a recent paper, Negri and Pavlović (Studia Logica 1–35, 2020) have formulated a decidable sequent calculus for the logic of agency, specifically for a deliberative see-to-it-that modality, or dstit. In that paper the adequacy of the system is demonstrated by showing the derivability of the axiomatization of dstit from Belnap et al. (Facing the future: agents and choices in our indeterminist world. Oxford University Press, Oxford, 2001). And while the influence of the latter book on the study …Read more
-
Ludwig Maximilians Universität, MünchenMunich Centre for Mathematical PhilosophyPost-doctoral Fellow
Munich, Bavaria, Germany
Areas of Specialization
Logic and Philosophy of Logic |
Formal Epistemology |
Agency |
Philosophy of Language |
Areas of Interest
Logic and Philosophy of Logic |
Formal Epistemology |
Agency |
Philosophy of Language |