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 showing that Aristotle’s assertoric (...) syllogistic is embeddable within, thus also providing another method of showing its decidability. (shrink)

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.

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 formulas containing non-denoting names are true, while negative free logic rejects even the latter claim. Inclusive logics, which reject, are likewise considered. These logics have complex and varied axiomatizations and semantics, and the goal of this paper is to present an orderly examination of the various systems and their mutual relations. This is done by first offering a formalization, using sequent calculi which possess all the desired structural properties of a good proof system, including admissibility of contraction and cut, while streamlining free logics in a way no other approach has. We then present a simple and unified system of abstract semantics, which allows for a straightforward demonstration of the meta-theoretical properties, and offers insights into the relationship between different logics. The final part of this paper is dedicated to extending the system with modalities by using a labeled sequent calculus, and here we are again able to map out the different approaches and their mutual relations using the same framework. (shrink)

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 paper, and then expand upon that result. Utilizing (...) recent developments in structural proof theory, we develop a G3-style sequent calculus for Quarc and briefly demonstrate its structural properties. We put these properties to use immediately to construct direct proofs of the meta-theoretical properties of the system. We then incorporate an abstract (and, as we shall see, logical) predicate into the system in a way that preserves all the structural properties. This allows us to identify a system of Quarc which is deductively equivalent to PC, and also yields a constructive method of demonstrating the Craig interpolation theorem (which speaks in favor of the aforementioned predicate being logical). We further generalize this extension to develop a bivalent system of Quarc with defining clauses that still maintains all the desirable properties of a good proof system. (shrink)

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 which proof theory sheds light on (...) philosophically substantial questions. (shrink)

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 (...) logics reject the claim that names need to denote in (ii). _Positive_ free logic concedes that some atomic formulas containing non-denoting names (including self-identity) are true, _negative_ free logic treats them as uniformly false, and _neutral_ free logic as taking a third value. There has been a renewed interest in analyzing proof theory of free logic in recent years, based on intuitionistic logic in Maffezioli and Orlandelli (_Bulletin of the Section of Logic_, _48_(2), 137–158 2019 ) as well as classical logic in Pavlović and Gratzl (_Journal of Philosophical Logic_, _50_, 117–148 2021 ), there for the positive and negative variants. While the latter streamlines the presentation of free logics and offers a more unified approach to the variants under consideration, it does not cover neutral free logic, since there is some lack of both clear formal intuitions on the semantic status of formulas with empty names, as well as a satisfying account of the conditional in this context. We discuss extending the results to this third major variant of free logics. We present a series of G3 sequent calculi adapted from Fjellstad (_Studia Logica_, _105_(1), 93–119 2017, _Journal of Applied Non-Classical Logics_, _30_(3), 272–289 2020 ), which possess all the desired structural properties of a good proof system, including admissibility of contraction and all versions of the cut rule. At the same time, we maintain the unified approach to free logics and moreover argue that greater clarity of intuitions is achieved once neutral free logic is conceptualized as consisting of two sub-varieties. (shrink)

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 application of propositional logic to those (...) sentences with relatively stable truth values. (shrink)

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.

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 left in the original presentation, which (...) did not incorporate identity systematically into Quarc, and although it proved the soundness of the system did not prove its completeness. (shrink)

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 of (...) logics of agency cannot be overstated, we note that this is not the only axiomatization of that modality available. In fact, an earlier (and arguably purer) one was offered in Xu (J Philosophical Logic 27(5):505–552, 1998). In this article we fill this lacuna by proving that this alternative axiomatization is likewise readily derivable in the system of Negri and Pavlović (Studia Logica 1–35, 2020). (shrink)

Розкрито сутність поняття «рейтинг». Доведено значущість рейтингової оцінки для суб’єктів фінансового ринку, зокрема для страхових компаній, потенційних страхувальників, інвесторів та кредиторів.

This chapter contains sections titled: Scientific Reasons Motivated by Morality? The Science of Religion Notes.

On Islamic doctrine, teachings and its practice.

This note is a generalization and improved interpretation of the main result of Karni and Schmeidler. A decision-maker is supposed to possess a preference relation on acts and another preference relation on state-prize lotteries, both of which are assumed to satisfy the von Neumann–Morgenstern axioms. In addition, the two preference relations restricted to a state of nature are assumed to agree. We show that these axioms are necessary and sufficient for the existence of subjective expected utility over acts with state-dependent (...) utility functions and a subjective probability measure. This subjective probability measure is unique when conditioned on the set of states of nature in which not all the prizes are equally desirable. (shrink)

The relative rate of success of parliamentary vs. governmental legislative initiative is quite different. The examination of one, resp. two full legislative term, for amendments, resp. bills introduced, shows thatparliamentary legislative initiative by far exceeds «regular» governmental initiative : in a ratio of 3 to 1 for bills, and of 4 to 1 for amendments. But the results are almost inverse : governmental initiative accounts for 76 % of the bills, and for 67 % of the amendments eventually voted. The (...) government succeeds in «pushing through» more than 90 % of its own initiatives, whereas parliamentary initiative hardly obtains an overall 10 % realization score. In an interrogative manner, the conclusion pointsto a few elements that may account for this situation. (shrink)

Pogled na kulturnopovijesna smjeranja -- Zajednica i nazovizajednica -- Značenje povijesne predaje.

Aprender Matemática na escola é deparar-se com um mundo de conceitos que envolvem leitura e compreensão, tanto da linguagem natural como da linguagem matemática. Muitas vezes, os componentes curriculares, a Língua Portuguesa e a Matemática não dialogam. A resolução de problemas parece ser um dos pontos críticos na Matemática escolar. Este artigo aproxima esses componentes de forma a buscar estratégias para uma aprendizagem efetiva.

RESUMO De acordo com Bakhtin, o dialogismo polifônico, um princípio geral para que haja um avanço de conhecimento, é bem representado no romance literário e mais comumente em narrativas, nas quais diferentes “vozes” podem ser expressas. Assim, neste artigo analisamos narrativas baseadas em imagens e construídas por trinta crianças, entre 5 e 8 anos de idade, falantes de francês, narrativas essas produzidas antes e depois de uma conversa sobre as causas dos eventos. As análises tiveram como foco a habilidade das (...) crianças de fazer diferentes vozes serem ouvidas, particularmente as vozes dos personagens, as quais as crianças fizeram ser ouvidas não apenas por meio do discurso direto e indireto, mas também por meio de expressões dos seus estados interiores, como crenças, intenções e sentimentos. Os resultados mostram tanto um desenvolvimento da habilidade das crianças de fazer com que essas vozes sejam ouvidas em suas narrativas, quanto um papel facilitador da troca conversacional em suas expressões. Argumentamos que esses resultados dão suporte para se considerar o lugar central que o diálogo ocupa no panorama geral da abordagem bakhtiniana. (shrink)

The latest book by Russian philosopher Sergey Mareev consists of two parts: recollections of his teacher Evald Ilyenkov, and reflections on some of the key themes of Ilyenkov’s philosophical heritage. The author traces several polemical lines related to the problem of the ideal, dialectics of the abstract and the concrete, the principle of historicism, as well as Ilyenkov’s interpretation of Spinoza and Hegel.