Switch to: References

Add citations

You must login to add citations.
  1. Consistency of Heyting arithmetic in natural deduction.Annika Kanckos - 2010 - Mathematical Logic Quarterly 56 (6):611-624.
    A proof of the consistency of Heyting arithmetic formulated in natural deduction is given. The proof is a reduction procedure for derivations of falsity and a vector assignment, such that each reduction reduces the vector. By an interpretation of the expressions of the vectors as ordinals each derivation of falsity is assigned an ordinal less than ε 0, thus proving termination of the procedure.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Proof-Theoretic Semantics, a Problem with Negation and Prospects for Modality.Nils Kürbis - 2015 - Journal of Philosophical Logic 44 (6):713-727.
    This paper discusses proof-theoretic semantics, the project of specifying the meanings of the logical constants in terms of rules of inference governing them. I concentrate on Michael Dummett’s and Dag Prawitz’ philosophical motivations and give precise characterisations of the crucial notions of harmony and stability, placed in the context of proving normalisation results in systems of natural deduction. I point out a problem for defining the meaning of negation in this framework and prospects for an account of the meanings of (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Modal Hybrid Logic.Andrzej Indrzejczak - 2007 - Logic and Logical Philosophy 16 (2-3):147-257.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Notation systems for infinitary derivations.Wilfried Buchholz - 1991 - Archive for Mathematical Logic 30 (5-6):277-296.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Gödel's Incompleteness Theorems.Panu Raatikainen - 2013 - The Stanford Encyclopedia of Philosophy (Winter 2013 Edition), Edward N. Zalta (Ed.).
    Gödel's two incompleteness theorems are among the most important results in modern logic, and have deep implications for various issues. They concern the limits of provability in formal axiomatic theories. The first incompleteness theorem states that in any consistent formal system F within which a certain amount of arithmetic can be carried out, there are statements of the language of F which can neither be proved nor disproved in F. According to the second incompleteness theorem, such a formal system cannot (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Plato's Problem: An Introduction to Mathematical Platonism.Marco Panza & Andrea Sereni - 2013 - New York: Palgrave-Macmillan. Edited by Andrea Sereni & Marco Panza.
    What is mathematics about? And if it is about some sort of mathematical reality, how can we have access to it? This is the problem raised by Plato, which still today is the subject of lively philosophical disputes. This book traces the history of the problem, from its origins to its contemporary treatment. It discusses the answers given by Aristotle, Proclus and Kant, through Frege's and Russell's versions of logicism, Hilbert's formalism, Gödel's platonism, up to the the current debate on (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Objectivity Sans Intelligibility. Hermann Weyl's Symbolic Constructivism.Iulian D. Toader - 2011 - Dissertation, University of Notre Dame
    A new form of skepticism is described, which holds that objectivity and understanding are incompossible ideals of modern science. This is attributed to Weyl, hence its name: Weylean skepticism. Two general defeat strategies are then proposed, one of which is rejected.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A verisimilitudinarian analysis of the Linda paradox.Gustavo Cevolani, Vincenzo Crupi & Roberto Festa - 2012 - VII Conference of the Spanish Society for Logic, Methodology and Philosphy of Science.
    The Linda paradox is a key topic in current debates on the rationality of human reasoning and its limitations. We present a novel analysis of this paradox, based on the notion of verisimilitude as studied in the philosophy of science. The comparison with an alternative analysis based on probabilistic confirmation suggests how to overcome some problems of our account by introducing an adequately defined notion of verisimilitudinarian confirmation.
    Download  
     
    Export citation  
     
    Bookmark  
  • Mathematical Infinity, Its Inventors, Discoverers, Detractors, Defenders, Masters, Victims, Users, and Spectators.Edward G. Belaga - manuscript
    "The definitive clarification of the nature of the infinite has become necessary, not merely for the special interests of the individual sciences, but rather for the honour of the human understanding itself. The infinite has always stirred the emotions of mankind more deeply than any other question; the infinite has stimulated and fertilized reason as few other ideas have ; but also the infinite, more than other notion, is in need of clarification." (David Hilbert 1925).
    Download  
     
    Export citation  
     
    Bookmark  
  • Klassinen matematiikka ja logiikka.Panu Raatikainen - 1996 - In Christoffer Gefwert (ed.), Logiikka, matematiikka ja tietokone – Perusteet: historiaa, filosofiaa ja sovelluksia. Finnish Artificial Intelligence Society.
    Toisaalta ennennäkemätön äärettömien joukko-opillisten menetelmien hyödyntäminen sekä toisaalta epäilyt niiden hyväksyttävyydestä ja halu oikeuttaa niiden käyttö ovat ratkaisevasti muovanneet vuosisatamme matematiikkaa ja logiikkaa. Tämän kehityksen vaikutus nykyajan filosofiaan on myös ollut valtaisa; merkittävää osaa siitä ei voi edes ymmärtää tuntematta sen yhteyttä tähän matematiikan ja logiikan vallankumoukseen. Lähestymistapoja, jotka tavalla tai toisella hyväksyvät äärettömän matematiikan ja perinteisten logiikan sääntöjen (erityisesti kolmannen poissuljetun lain) soveltamisen myös sen piirissä, on tullut tavaksi kutsua klassiseksi matematiikaksi ja logiikaksi erotuksena nämä hylkäävistä radikaaleista intuitionistisista ja (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The development of mathematical logic from Russell to Tarski, 1900-1935.Paolo Mancosu, Richard Zach & Calixto Badesa - 2009 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press.
    The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Too naturalist and not naturalist enough: Reply to Horsten.Luca Incurvati - 2008 - Erkenntnis 69 (2):261 - 274.
    Leon Horsten has recently claimed that the class of mathematical truths coincides with the class of theorems of ZFC. I argue that the naturalistic character of Horsten’s proposal undermines his contention that this claim constitutes an analogue of a thesis that Daniel Isaacson has advanced for PA. I argue, moreover, that Horsten’s defence of his claim against an obvious objection makes use of a distinction which is not available to him given his naturalistic approach. I suggest a way out of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Godel's unpublished papers on foundations of mathematics.W. W. Tatt - 2001 - Philosophia Mathematica 9 (1):87-126.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Normal natural deduction proofs (in classical logic).Wilfried Sieg & John Byrnes - 1998 - Studia Logica 60 (1):67-106.
    Natural deduction (for short: nd-) calculi have not been used systematically as a basis for automated theorem proving in classical logic. To remove objective obstacles to their use we describe (1) a method that allows to give semantic proofs of normal form theorems for nd-calculi and (2) a framework that allows to search directly for normal nd-proofs. Thus, one can try to answer the question: How do we bridge the gap between claims and assumptions in heuristically motivated ways? This informal (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Logical Disagreement.Frederik J. Andersen - 2024 - Dissertation, University of St. Andrews
    While the epistemic significance of disagreement has been a popular topic in epistemology for at least a decade, little attention has been paid to logical disagreement. This monograph is meant as a remedy. The text starts with an extensive literature review of the epistemology of (peer) disagreement and sets the stage for an epistemological study of logical disagreement. The guiding thread for the rest of the work is then three distinct readings of the ambiguous term ‘logical disagreement’. Chapters 1 and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Gentzen’s “cut rule” and quantum measurement in terms of Hilbert arithmetic. Metaphor and understanding modeled formally.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal 14 (14):1-37.
    Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also justifying that unity by quantum neo-Pythagoreanism links (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Judgement and the Epistemic Foundation of Logic.Maria van der Schaar (ed.) - 2012 - Dordrecht, Netherland: Springer.
    This compelling reevaluation of the relationship between logic and knowledge affirms the key role that the notion of judgement must play in such a review. The commentary repatriates the concept of judgement in the discussion, banished in recent times by the logical positivism of Wittgenstein, Hilbert and Schlick, and the Platonism of Bolzano. The volume commences with the insights of Swedish philosopher Per Martin-Löf, the father of constructive type theory, for whom logic is a demonstrative science in which judgement is (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Quantum Strategy of Completeness: On the Self-Foundation of Mathematics.Vasil Penchev - 2020 - Cultural Anthropology eJournal (Elsevier: SSRN) 5 (136):1-12.
    Gentzen’s approach by transfinite induction and that of intuitionist Heyting arithmetic to completeness and the self-foundation of mathematics are compared and opposed to the Gödel incompleteness results as to Peano arithmetic. Quantum mechanics involves infinity by Hilbert space, but it is finitist as any experimental science. The absence of hidden variables in it interpretable as its completeness should resurrect Hilbert’s finitism at the cost of relevant modification of the latter already hinted by intuitionism and Gentzen’s approaches for completeness. This paper (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Shadows of Syntax: Revitalizing Logical and Mathematical Conventionalism.Jared Warren - 2020 - New York, USA: Oxford University Press.
    What is the source of logical and mathematical truth? This book revitalizes conventionalism as an answer to this question. Conventionalism takes logical and mathematical truth to have their source in linguistic conventions. This was an extremely popular view in the early 20th century, but it was never worked out in detail and is now almost universally rejected in mainstream philosophical circles. Shadows of Syntax is the first book-length treatment and defense of a combined conventionalist theory of logic and mathematics. It (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Pasch's empiricism as methodological structuralism.Dirk Schlimm - 2020 - In Erich H. Reck & Georg Schiemer (eds.), The Pre-History of Mathematical Structuralism. Oxford: Oxford University Press. pp. 80-105.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
    A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Representation and Reality by Language: How to make a home quantum computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.
    A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored. The problem of completeness of mathematics is linked to its counterpart in quantum mechanics. That model includes two Peano arithmetics or Turing machines independent of each other. The complex Hilbert space underlying quantum mechanics as the base of its mathematical formalism is interpreted as a generalization of Peano arithmetic: It is a doubled infinite set of doubled Peano arithmetics having a remarkable (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Отвъд машината на Тюринг: квантовият компютър.Vasil Penchev - 2014 - Sofia: BAS: ISSK (IPS).
    Quantum computer is considered as a generalization of Turing machine. The bits are substituted by qubits. In turn, a "qubit" is the generalization of "bit" referring to infinite sets or series. It extends the consept of calculation from finite processes and algorithms to infinite ones, impossible as to any Turing machines (such as our computers). However, the concept of quantum computer mets all paradoxes of infinity such as Gödel's incompletness theorems (1931), etc. A philosophical reflection on how quantum computer might (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Maddy On The Multiverse.Claudio Ternullo - 2019 - In Stefania Centrone, Deborah Kant & Deniz Sarikaya (eds.), Reflections on the Foundations of Mathematics: Univalent Foundations, Set Theory and General Thoughts. Springer Verlag. pp. 43-78.
    Penelope Maddy has recently addressed the set-theoretic multiverse, and expressed reservations on its status and merits ([Maddy, 2017]). The purpose of the paper is to examine her concerns, by using the interpretative framework of set-theoretic naturalism. I first distinguish three main forms of 'multiversism', and then I proceed to analyse Maddy's concerns. Among other things, I take into account salient aspects of multiverse-related mathematics , in particular, research programmes in set theory for which the use of the multiverse seems to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Dag Prawitz on Proofs and Meaning.Heinrich Wansing (ed.) - 2014 - Cham, Switzerland: Springer.
    This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Negation and infinity.Kazimierz Trzęsicki - 2018 - Studies in Logic, Grammar and Rhetoric 54 (1):131-148.
    Infinity and negation are in various relations and interdependencies one to another. The analysis of negation and infinity aims to better understanding them. Semantical, syntactical, and pragmatic issues will be considered.
    Download  
     
    Export citation  
     
    Bookmark  
  • Bilateralism: Negations, Implications and some Observations and Problems about Hypotheses.Nils Kürbis - 2017 - In Thomas Piecha & Jean Fichot (eds.), Beyond Logic. Proceedings of the Conference held in Cerisy-la-Salle, 22-27 May 2017.
    This short paper has two loosely connected parts. In the first part, I discuss the difference between classical and intuitionist logic in relation to different the role of hypotheses play in each logic. Harmony is normally understood as a relation between two ways of manipulating formulas in systems of natural deduction: their introduction and elimination. I argue, however, that there is at least a third way of manipulating formulas, namely the discharge of assumption, and that the difference between classical and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Reinhard Kahle and Michael Rathjen : Gentzen’s Centenary. The Quest for Consistency.David Binder - 2018 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 49 (3):475-479.
    Download  
     
    Export citation  
     
    Bookmark  
  • Theories of truth and the maxim of minimal mutilation.Ole Thomassen Hjortland - 2017 - Synthese 199 (Suppl 3):787-818.
    Nonclassical theories of truth have in common that they reject principles of classical logic to accommodate an unrestricted truth predicate. However, different nonclassical strategies give up different classical principles. The paper discusses one criterion we might use in theory choice when considering nonclassical rivals: the maxim of minimal mutilation.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Lieber Herr Bernays!, Lieber Herr Gödel! Gödel on finitism, constructivity and Hilbert's program.Solomon Feferman - 2008 - Dialectica 62 (2):179-203.
    This is a survey of Gödel's perennial preoccupations with the limits of finitism, its relations to constructivity, and the significance of his incompleteness theorems for Hilbert's program, using his published and unpublished articles and lectures as well as the correspondence between Bernays and Gödel on these matters. There is also an important subtext, namely the shadow of Hilbert that loomed over Gödel from the beginning to the end.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Hilbert’s Program.Richard Zach - 2014 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. Stanford, CA: The Metaphysics Research Lab.
    In the early 1920s, the German mathematician David Hilbert (1862–1943) put forward a new proposal for the foundation of classical mathematics which has come to be known as Hilbert's Program. It calls for a formalization of all of mathematics in axiomatic form, together with a proof that this axiomatization of mathematics is consistent. The consistency proof itself was to be carried out using only what Hilbert called “finitary” methods. The special epistemological character of finitary reasoning then yields the required justification (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Philosophy of Quantum Probability - An empiricist study of its formalism and logic.Ronnie Hermens - unknown
    The use of probability theory is widespread in our daily life as well as in scientific theories. In virtually all cases, calculations can be carried out within the framework of classical probability theory. A special exception is given by quantum mechanics, which gives rise to a new probability theory: quantum probability theory. This dissertation deals with the question of how this formalism can be understood from a philosophical and physical perspective. The dissertation is divided into three parts. In the first (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)What is wrong with classical negation?Nils Kürbis - 2015 - Grazer Philosophische Studien 92 (1):51-86.
    The focus of this paper are Dummett's meaning-theoretical arguments against classical logic based on consideration about the meaning of negation. Using Dummettian principles, I shall outline three such arguments, of increasing strength, and show that they are unsuccessful by giving responses to each argument on behalf of the classical logician. What is crucial is that in responding to these arguments a classicist need not challenge any of the basic assumptions of Dummett's outlook on the theory of meaning. In particular, I (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Survey of Nonstandard Sequent Calculi.Andrzej Indrzejczak - 2014 - Studia Logica 102 (6):1295-1322.
    The paper is a brief survey of some sequent calculi which do not follow strictly the shape of sequent calculus introduced by Gentzen. We propose the following rough classification of all SC: Systems which are based on some deviations from the ordinary notion of a sequent are called generalised; remaining ones are called ordinary. Among the latter we distinguish three types according to the proportion between the number of primitive sequents and rules. In particular, in one of these types, called (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Hilberts Logik. Von der Axiomatik zur Beweistheorie.Volker Peckhaus - 1995 - NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin 3 (1):65-86.
    This paper gives a survey of David Hilbert's (1862–1943) changing attitudes towards logic. The logical theory of the Göttingen mathematician is presented as intimately linked to his studies on the foundation of mathematics. Hilbert developed his logical theory in three stages: (1) in his early axiomatic programme until 1903 Hilbert proposed to use the traditional theory of logical inferences to prove the consistency of his set of axioms for arithmetic. (2) After the publication of the logical and set-theoretical paradoxes by (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Hilbert's problems.J. Fang - 1969 - Philosophia Mathematica (1-2):38-53.
    Download  
     
    Export citation  
     
    Bookmark  
  • Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.
    A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Kreisel's 'Unwinding Program'.Solomon Feferman - 1996 - In Piergiorgio Odifreddi (ed.), Kreiseliana: About and Around Georg Kreisel. A K Peters. pp. 247--273.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Mathematical proof theory in the light of ordinal analysis.Reinhard Kahle - 2002 - Synthese 133 (1/2):237 - 255.
    We give an overview of recent results in ordinal analysis. Therefore, we discuss the different frameworks used in mathematical proof-theory, namely "subsystem of analysis" including "reverse mathematics", "Kripke-Platek set theory", "explicit mathematics", "theories of inductive definitions", "constructive set theory", and "Martin-Löf's type theory".
    Download  
     
    Export citation  
     
    Bookmark  
  • Where is the Gödel-Point Hiding: Gentzen’s Consistency Proof of 1936 and His Representation of Constructive Ordinals.Anna Horská - 2013 - Cham, Switzerland: Springer.
    This book explains the first published consistency proof of PA. It contains the original Gentzen's proof, but it uses modern terminology and examples to illustrate the essential notions. The author comments on Gentzen's steps which are supplemented with exact calculations and parts of formal derivations. A notable aspect of the proof is the representation of ordinal numbers that was developed by Gentzen. This representation is analysed and connection to set-theoretical representation is found, namely an algorithm for translating Gentzen's notation into (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Nominalistic ordinals, recursion on higher types, and finitism.Maria Hämeen-Anttila - 2019 - Bulletin of Symbolic Logic 25 (1):101-124.
    In 1936, Gerhard Gentzen published a proof of consistency for Peano Arithmetic using transfinite induction up to ε0, which was considered a finitistically acceptable procedure by both Gentzen and Paul Bernays. Gentzen’s method of arithmetising ordinals and thus avoiding the Platonistic metaphysics of set theory traces back to the 1920s, when Bernays and David Hilbert used the method for an attempted proof of the Continuum Hypothesis. The idea that recursion on higher types could be used to simulate the limit-building in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Commentary and Illocutionary Expressions in Linear Calculi of Natural Deduction.Moritz Cordes & Friedrich Reinmuth - 2017 - Logic and Logical Philosophy 26 (2).
    We argue that the need for commentary in commonly used linear calculi of natural deduction is connected to the “deletion” of illocutionary expressions that express the role of propositions as reasons, assumptions, or inferred propositions. We first analyze the formalization of an informal proof in some common calculi which do not formalize natural language illocutionary expressions, and show that in these calculi the formalizations of the example proof rely on commentary devices that have no counterpart in the original proof. We (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On the Concept of Finitism.Luca Incurvati - 2015 - Synthese 192 (8):2413-2436.
    At the most general level, the concept of finitism is typically characterized by saying that finitistic mathematics is that part of mathematics which does not appeal to completed infinite totalities and is endowed with some epistemological property that makes it secure or privileged. This paper argues that this characterization can in fact be sharpened in various ways, giving rise to different conceptions of finitism. The paper investigates these conceptions and shows that they sanction different portions of mathematics as finitistic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Hilbert's 'Verunglückter Beweis', the first epsilon theorem, and consistency proofs.Richard Zach - 2004 - History and Philosophy of Logic 25 (2):79-94.
    In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert's first epsilon theorem and a certain "general consistency result" due to Bernays. An analysis of the form of this so-called "failed proof" (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The machinery of consistency proofs.Mariko Yasugi - 1989 - Annals of Pure and Applied Logic 44 (1-2):139-152.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Natural deduction with general elimination rules.Jan von Plato - 2001 - Archive for Mathematical Logic 40 (7):541-567.
    The structure of derivations in natural deduction is analyzed through isomorphism with a suitable sequent calculus, with twelve hidden convertibilities revealed in usual natural deduction. A general formulation of conjunction and implication elimination rules is given, analogous to disjunction elimination. Normalization through permutative conversions now applies in all cases. Derivations in normal form have all major premisses of elimination rules as assumptions. Conversion in any order terminates.Through the condition that in a cut-free derivation of the sequent Γ⇒C, no inactive weakening (...)
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Mathematics, the empirical facts, and logical necessity.John C. Harsanyi - 1983 - Erkenntnis 19 (1-3):167 - 192.
    It is argued that mathematical statements are "a posteriori synthetic" statements of a very special sort, To be called "structure-Analytic" statements. They follow logically from the axioms defining the mathematical structure they are describing--Provided that these axioms are "consistent". Yet, Consistency of these axioms is an empirical claim: it may be "empirically verifiable" by existence of a finite model, Or may have the nature of an "empirically falsifiable hypothesis" that no contradiction can be derived from the axioms.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Reduction of finite and infinite derivations.G. Mints - 2000 - Annals of Pure and Applied Logic 104 (1-3):167-188.
    We present a general schema of easy normalization proofs for finite systems S like first-order arithmetic or subsystems of analysis, which have good infinitary counterparts S ∞ . We consider a new system S ∞ + with essentially the same rules as S ∞ but different derivable objects: a derivation d∈S ∞ + of a sequent Γ contains a derivation Φ∈S of Γ . Three simple conditions on Φ including a normal form theorem for S ∞ + easily imply a (...)
    Download  
     
    Export citation  
     
    Bookmark