A Partial Calculus for Dag Prawitz’s Theory of Grounds and a Decidability Issue

In Antonio Piccolomini D’Aragona, Martin Carrier, Roger Deulofeu, Axel Gelfert, Jens Harbecke, Paul Hoyningen-Huene, Lara Huber, Peter Hucklenbroich, Ludger Jansen, Elizaveta Kostrova, Keizo Matsubara, Anne Sophie Meincke, Andrea Reichenberger, Kian Salimkhani & Javier Suárez (eds.), Philosophy of Science: Between the Natural Sciences, the Social Sciences, and the Humanities. Cham: Springer Verlag. pp. 223-244 (2018)
  Copy   BIBTEX

Abstract

We consider Dag Prawitz’s theory of grounds and suggest a formal apparatus for it. On its basis we show that the account faces a decidability issue similar to one that is often associated with BHK semantics, and propose different readings of the issue that involve different consequences.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/978-3-319-72577-2_13

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Dag Prawitz on Proofs, Operations and Grounding.Antonio Piccolomini D’ Aragona - 2019 - Topoi 38 (3):531-550.
Poincaré and Prawitz on mathematical induction.Yacin Hamami - 2015 - In Pavel Arazim & Michal Dancak (eds.), Logica Yearbook 2014. London: College Publications. pp. 149-164.
Necessity of Thought.Cesare Cozzo - 2015 - In Heinrich Wansing (ed.), Dag Prawitz on Proofs and Meaning. Springer. pp. 101-20.
A Comprehensive Picture of the Decidability of Mereological Theories.Hsing-Chien Tsai - 2013 - Studia Logica 101 (5):987-1012.
Decidability, partial decidability and sharpness relation for l-subsets.Giangiacomo Gerla - 1987 - Studia Logica 46 (3):227-238.
Decidability of a Hybrid Duration Calculus.Thomas Bolander, Jens Ulrik Hansen & Michael R. Hansen - 2007 - Electronic Notes in Theoretical Computer Science 174 (3):113-133.
On the decidability of implicational ticket entailment.Katalin Bimbó & J. Michael Dunn - 2013 - Journal of Symbolic Logic 78 (1):214-236.
On the decidability of the PVD class with equality.N. Peltier - 2001 - Logic Journal of the IGPL 9 (4):569-592.
Inferentialism without Verificationism: Reply to Prawitz.Julien Murzi - 2011 - In Emiliano Ippoliti & Carlo Cellucci (eds.), Logic and Knowledge. Cambridge Scholars Press. pp. 285-90.
Decidability and generalized quantifiers.Andreas Baudisch (ed.) - 1980 - Berlin: Akademie Verlag.
In memoriam: Michael Dummett 1925-2011.Dag Prawitz - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
The fundamental: Ungrounded or all-grounding?Stephan Leuenberger - 2020 - Philosophical Studies 177 (9):2647-2669.
The Decidability of the Class and the Axiom of Foundation.Dorella Bellè & Franco Parlamento - 2001 - Notre Dame Journal of Formal Logic 42 (1):41-53.
Gentzen-Style Sequent Calculus for Semi-intuitionistic Logic.Diego Castaño & Juan Manuel Cornejo - 2016 - Studia Logica 104 (6):1245-1265.
Comparing First Order Theories of Modules over Group Rings II: Decidability: Decidability.Carlo Toffalori & S. Cittadini - 2002 - Mathematical Logic Quarterly 48 (4):483-498.

Analytics

Added to PP
2020-06-17

Downloads
2 (#1,787,337)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Antonio Piccolomini D'Aragona
Université d'Aix-Marseille III

Citations of this work

Add more citations

References found in this work

No references found.

Add more references