The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem. Propositional, first-order, and modal display calculi are considered and their properties detailed.

In this paper we study families of resource aware logics that explore resource restriction on rules; in particular, we study the use of controlled cut-rule and introduce three families of parameterised logics that arise from different ways of controlling the use of cut. We start with a formulation of classical logic in which cut is non-eliminable and then impose restrictions on the use of cut. Three Cut-and-Pay families of logics are presented, and it is shown that each family provides an (...) approximation process for full propositional classical logic when the control over the use of cut is progressively weakened. A sound and complete semantics is given for each component of each of the three families of approximated logics. One of these families is shown to possess the uniform substitution property, a new result for approximated reasoning. A tableau based decision procedure is presented for each element of the approximation families and the complexity of each decision procedure is studied. We show that there are families in which every component logic can be decided polynomially. (shrink)

This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.

This paper reports on an exploration of Boolos’ Curious Inference, using higher-order automated theorem provers (ATPs). Surprisingly, only suitable shorthand notations had to be provided by hand for ATPs to find a short proof. The higher-order lemmas required for constructing a short proof are automatically discovered by the ATPs. Given the observations and suggestions in this paper, full proof automation of Boolos’ and related examples now seems to be within reach of higher-order ATPs.

Call an argument a ‘happy sorites’ if it is a sorites argument with true premises and a false conclusion. It is a striking fact that although most philosophers working on the sorites paradox find it at prima facie highly compelling that the premises of the sorites paradox are true and its conclusion false, few (if any) of the standard theories on the issue ultimately allow for happy sorites arguments. There is one philosophical view, however, that appears to allow for at (...) least some happy sorites arguments: strict finitism in the philosophy of mathematics. My aim in this paper is to explore to what extent this appearance is accurate. As we shall see, this question is far from trivial. In particular, I will discuss two arguments that threaten to show that strict finitism cannot consistently accept happy sorites arguments, but I will argue that (given reasonable assumptions on strict finitistic logic) these arguments can ultimately be avoided, and the view can indeed allow for happy sorites arguments. (shrink)

This paper presents Rasiowa–Sikorski deduction systems for logics \, \, \ and \. For each of the logics two systems are developed: an R–S system that can be supplemented with admissible cut rule, and a \-version of R–S system in which the non-admissible rule of cut is the only branching rule. The systems are presented in a Smullyan-like uniform notation, extended and adjusted to the aims of this paper. Completeness is proved by the use of abstract refutability properties which are (...) dual to consistency properties used by Fitting. Also the notion of admissibility of a rule in an R–S-system is analysed. (shrink)

This is an extended version of the lectures given during the 12-thConference on Applications of Logic in Philosophy and in the Foundationsof Mathematics in Szklarska Poręba. It contains a surveyof modal hybrid logic, one of the branches of contemporary modal logic. Inthe first part a variety of hybrid languages and logics is presented with adiscussion of expressivity matters. The second part is devoted to thoroughexposition of proof methods for hybrid logics. The main point is to showthat application of hybrid logics (...) may remarkably improve the situation inmodal proof theory. (shrink)

In this paper, we investigate the phenomenon ofspeed-upin the context of theories of truth. We focus on axiomatic theories of truth extending Peano arithmetic. We are particularly interested on whether conservative extensions of PA have speed-up and on how this relates to a deflationist account. We show that disquotational theories have no significant speed-up, in contrast to some compositional theories, and we briefly assess the philosophical implications of these results.

Résumé. En trente ans, le rapport d’Internet à l’entreprise scientifique a changé. Nous sommes passés d’un instrument de collaboration scientifique à un dispositif de réseaux sociaux qui assure la plus large diffusion à l’irrationalisme et à l’alt-factualisme. Pour comprendre ce changement, il convient de réexaminer les mécanismes de la convergence des opinions. La première source de cette convergence est l’existence d’un monde commun, qui nous expose aux mêmes faits et qui détermine par révision successive des croyances de chacun, sans que (...) la moindre communication soit requise, une convergence asymptotique des opinions, et ce quelles que soient les croyances de départ. Naturellement, si les faits connus par les uns sont communiqués aux autres, cette convergence s’accélère considérablement, si bien que nous devons considérer la connaissance comme le résultat d’une activité collective, et l’échange d’informations comme l’une de ses sources nécessaires. D’une part, cette coopération épistémique est naturelle et facilement implémentable : en vertu des propriétés caractéristiques de l’information, qui est un bien que nous conservons lorsque nous le donnons, le partage informationnel est exempt des difficultés qui affectent généralement la coopération. D’autre part, cette coopération est intrinsèquement productive : la collaboration entre celui qui sait que φ et celui qui sait que φ implique ψ met chacun des deux agents en possession de la connaissance de ψ, qui n’était pourtant détenue par personne avant l’échange. L’internet des débuts donne à cette coopération informationnelle une ampleur inégalée. La situation actuelle est différente. Un certain nombre de facteurs, dont la porosité croissante entre les scientifiques et le large public, ont mis au premier plan l’échange, non des informations factuelles, mais celui des opinions. Les biais notoires de la psychologie humaine, au premier rang desquels le biais de confirmation, tendent à inverser le rapport entre les faits et les opinions. On cherche les faits confirmant les opinions entretenues, on met en doute les faits récalcitrants et l’on crée des faits corroborants. En bref, on passe d’une problématique de la coopération à une logique de l’affiliation, segmentant l’internet en groupes doxastiques homogènes. (shrink)

David Ripley ha argumentado extensamente a favor de una teoría no-transitiva de la verdad que abandona la regla de Corte para así evitar las pruebas de trivialidad causadas por paradojas como la del mentiroso. Sin embargo, es problemático comparar su teoría con varias teorías clásicas que se han ofrecido en la bibliografía. La tarea de formular esta teoría sobre la aritmética de Peano no es trivial, ya que Corte no es eliminable en la aritmética de Peano. En este artículo intento (...) cerrar esta brecha proponiendo una restricción adecuada para la regla de Corte. La restricción nos permite formular una teoría no-transitiva de la verdad sobre la aritmética de Peano que es, desde el punto de vista de la teoría de la prueba, tan fuerte como la teoría clásica de la verdad más fuerte conocida hasta el momento. (shrink)

In this paper we explore a generalization of traditional abduction which can simultaneously perform two different tasks: given an unprovable sequent Γ ⊢ G, find a sentence H such that Γ, H ⊢ G is provable ; given a provable sequent Γ ⊢ G, find a sentence H such that Γ ⊢ H and the proof of Γ, H ⊢ G is simpler than the proof of Γ ⊢ G . We argue that the two tasks should not be distinguished, (...) and present a general procedure for finding suitable hypotheses or lemmas. When the original sequent is provable, the abduced formula can be seen as a cut formula with respect to Gentzen's sequent calculus, so the abduction method is cut-based. Our method is based on the tableau-like system KE and we argue for its advantages over existing abduction methods based on traditional Smullyan-style Tableaux. (shrink)

The main aim of the present paper is to use a proof system for hybrid modal logic to formalize what are called false-belief tasks in cognitive psychology, thereby investigating the interplay between cognition and logical reasoning about belief. We consider two different versions of the Smarties task, involving respectively a shift of perspective to another person and to another time. Our formalizations disclose that despite this difference, the two versions of the Smarties task have exactly the same underlying logical structure. (...) We also consider the Sally-Anne task, having a more complicated logical structure, presupposing a “principle of inertia” saying that a belief is preserved over time, unless there is belief to the contrary. (shrink)

We describe a class of semantic extensive entailment game with algorithmic players, related to game-theoretic semantics, and generalized to classical first-order semantic entailment. Players have preferences for parsimonious spending of computational resources, and compute partial strategies, under qualitative uncertainty about future histories. We prove the existence of local preferences for moves, and strategic fixpoints, that allow to map eeg game-tree to the building rules and closure rules of Smullyan's semantic tableaux. We also exhibit a strategy profile that solves the fixpoint (...) selection problem, and can be mapped to systematic constructions of semantic trees, yielding a completeness result by translation. We conclude on possible generalizations of our games. (shrink)