Switch to: References

Add citations

You must login to add citations.
  1. Philosophy of Mathematical Practice — Motivations, Themes and Prospects†.Jessica Carter - 2019 - Philosophia Mathematica 27 (1):1-32.
    A number of examples of studies from the field ‘The Philosophy of Mathematical Practice’ (PMP) are given. To characterise this new field, three different strands are identified: an agent-based, a historical, and an epistemological PMP. These differ in how they understand ‘practice’ and which assumptions lie at the core of their investigations. In the last part a general framework, capturing some overall structure of the field, is proposed.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Does mathematics need new axioms.Solomon Feferman, Harvey M. Friedman, Penelope Maddy & John R. Steel - 1999 - Bulletin of Symbolic Logic 6 (4):401-446.
    Part of the ambiguity lies in the various points of view from which this question might be considered. The crudest di erence lies between the point of view of the working mathematician and that of the logician concerned with the foundations of mathematics. Now some of my fellow mathematical logicians might protest this distinction, since they consider themselves to be just more of those \working mathematicians". Certainly, modern logic has established itself as a very respectable branch of mathematics, and there (...)
    Download  
     
    Export citation  
     
    Bookmark   79 citations  
  • Semantics and Truth.Jan Woleński - 2019 - Cham, Switzerland: Springer Verlag.
    The book provides a historical and systematic exposition of the semantic theory of truth formulated by Alfred Tarski in the 1930s. This theory became famous very soon and inspired logicians and philosophers. It has two different, but interconnected aspects: formal-logical and philosophical. The book deals with both, but it is intended mostly as a philosophical monograph. It explains Tarski’s motivation and presents discussions about his ideas as well as points out various applications of the semantic theory of truth to philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Axiomatizing semantic theories of truth?Martin Fischer, Volker Halbach, Jönne Kriener & Johannes Stern - 2015 - Review of Symbolic Logic 8 (2):257-278.
    We discuss the interplay between the axiomatic and the semantic approach to truth. Often, semantic constructions have guided the development of axiomatic theories and certain axiomatic theories have been claimed to capture a semantic construction. We ask under which conditions an axiomatic theory captures a semantic construction. After discussing some potential criteria, we focus on the criterion of ℕ-categoricity and discuss its usefulness and limits.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.
    We show that each of the five basic theories of second order arithmetic that play a central role in reverse mathematics has a natural counterpart in the language of nonstandard arithmetic. In the earlier paper [3] we introduced saturation principles in nonstandard arithmetic which are equivalent in strength to strong choice axioms in second order arithmetic. This paper studies principles which are equivalent in strength to weaker theories in second order arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Hilbert’s Program.Richard Zach - 2012 - In Ed Zalta, Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.
    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  
  • A graph model for probabilities of nested conditionals.Anna Wójtowicz & Krzysztof Wójtowicz - 2022 - Linguistics and Philosophy 45 (3):511-558.
    We define a model for computing probabilities of right-nested conditionals in terms of graphs representing Markov chains. This is an extension of the model for simple conditionals from Wójtowicz and Wójtowicz. The model makes it possible to give a formal yet simple description of different interpretations of right-nested conditionals and to compute their probabilities in a mathematically rigorous way. In this study we focus on the problem of the probabilities of conditionals; we do not discuss questions concerning logical and metalogical (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Neo-Logicism and Its Logic.Panu Raatikainen - 2020 - History and Philosophy of Logic 41 (1):82-95.
    The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Applied Mathematics without Numbers.Jack Himelright - 2023 - Philosophia Mathematica 31 (2):147-175.
    In this paper, I develop a "safety result" for applied mathematics. I show that whenever a theory in natural science entails some non-mathematical conclusion via an application of mathematics, there is a counterpart theory that carries no commitment to mathematical objects, entails the same conclusion, and the claims of which are true if the claims of the original theory are "correct": roughly, true given the assumption that mathematical objects exist. The framework used for proving the safety result has some advantages (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Axioms in Mathematical Practice.Dirk Schlimm - 2013 - Philosophia Mathematica 21 (1):37-92.
    On the basis of a wide range of historical examples various features of axioms are discussed in relation to their use in mathematical practice. A very general framework for this discussion is provided, and it is argued that axioms can play many roles in mathematics and that viewing them as self-evident truths does not do justice to the ways in which mathematicians employ axioms. Possible origins of axioms and criteria for choosing axioms are also examined. The distinctions introduced aim at (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.
    We present a new functional interpretation, based on a novel assignment of formulas. In contrast with Gödel’s functional “Dialectica” interpretation, the new interpretation does not care for precise witnesses of existential statements, but only for bounds for them. New principles are supported by our interpretation, including the FAN theorem, weak König’s lemma and the lesser limited principle of omniscience. Conspicuous among these principles are also refutations of some laws of classical logic. Notwithstanding, we end up discussing some applications of the (...)
    Download  
     
    Export citation  
     
    Bookmark   35 citations  
  • Conceptions of the continuum.Solomon Feferman - unknown
    Key words: the continuum, structuralism, conceptual structuralism, basic structural conceptions, Euclidean geometry, Hilbertian geometry, the real number system, settheoretical conceptions, phenomenological conceptions, foundational conceptions, physical conceptions.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Deflationism beyond arithmetic.Kentaro Fujimoto - 2019 - Synthese 196 (3):1045-1069.
    The conservativeness argument poses a dilemma to deflationism about truth, according to which a deflationist theory of truth must be conservative but no adequate theory of truth is conservative. The debate on the conservativeness argument has so far been framed in a specific formal setting, where theories of truth are formulated over arithmetical base theories. I will argue that the appropriate formal setting for evaluating the conservativeness argument is provided not by theories of truth over arithmetic but by those over (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • (1 other version)Predicativity.Solomon Feferman - 2005 - In Stewart Shapiro, Oxford Handbook of Philosophy of Mathematics and Logic. Oxford and New York: Oxford University Press. pp. 590-624.
    What is predicativity? While the term suggests that there is a single idea involved, what the history will show is that there are a number of ideas of predicativity which may lead to different logical analyses, and I shall uncover these only gradually. A central question will then be what, if anything, unifies them. Though early discussions are often muddy on the concepts and their employment, in a number of important respects they set the stage for the further developments, and (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.
    In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or computable relations between such operations is Weihrauch reducibility and the partially ordered degree structure induced by it. We have identified certain choice (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Logicism, Interpretability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Review of Symbolic Logic 7 (1):84-119.
    A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are representable in the logical principles. The notions of representation considered here are related to theory-based and structure-based notions of representation (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.
    This article bears on four topics: observational predicates and phenomenal properties, vagueness, strict finitism as a philosophy of mathematics, and the analysis of feasible computability. It is argued that reactions to strict finitism point towards a semantics for vague predicates in the form of nonstandard models of weak arithmetical theories of the sort originally introduced to characterize the notion of feasibility as understood in computational complexity theory. The approach described eschews the use of nonclassical logic and related devices like degrees (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.
    A number of classical theories are interpreted in analogous theories that are based on intuitionistic logic. The classical theories considered include subsystems of first- and second-order arithmetic, bounded arithmetic, and admissible set theory.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Stable and Unstable Theories of Truth and Syntax.Beau Madison Mount & Daniel Waxman - 2021 - Mind 130 (518):439-473.
    Recent work on formal theories of truth has revived an approach, due originally to Tarski, on which syntax and truth theories are sharply distinguished—‘disentangled’—from mathematical base theories. In this paper, we defend a novel philosophical constraint on disentangled theories. We argue that these theories must be epistemically stable: they must possess an intrinsic motivation justifying no strictly stronger theory. In a disentangled setting, even if the base and the syntax theory are individually stable, they may be jointly unstable. We contend (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Searching for an analogue of atr0 in the Weihrauch lattice.Takayuki Kihara, Alberto Marcone & Arno Pauly - 2020 - Journal of Symbolic Logic 85 (3):1006-1043.
    There are close similarities between the Weihrauch lattice and the zoo of axiom systems in reverse mathematics. Following these similarities has often allowed researchers to translate results from one setting to the other. However, amongst the big five axiom systems from reverse mathematics, so far $\mathrm {ATR}_0$ has no identified counterpart in the Weihrauch degrees. We explore and evaluate several candidates, and conclude that the situation is complicated.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Pincherle's theorem in reverse mathematics and computability theory.Dag Normann & Sam Sanders - 2020 - Annals of Pure and Applied Logic 171 (5):102788.
    We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e. one of the first ‘local-to-global’ principles. It is well-known that such principles in analysis are intimately connected to (open-cover) compactness, but we nonetheless exhibit fundamental differences between compactness and Pincherle's theorem. For instance, the main question of Reverse Mathematics, namely which set existence axioms are necessary to (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Does reductive proof theory have a viable rationale?Solomon Feferman - 2000 - Erkenntnis 53 (1-2):63-96.
    The goals of reduction andreductionism in the natural sciences are mainly explanatoryin character, while those inmathematics are primarily foundational.In contrast to global reductionistprograms which aim to reduce all ofmathematics to one supposedly ``universal'' system or foundational scheme, reductive proof theory pursues local reductions of one formal system to another which is more justified in some sense. In this direction, two specific rationales have been proposed as aims for reductive proof theory, the constructive consistency-proof rationale and the foundational reduction rationale. However, (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger, Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.
    Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, but have been (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Logicism and Neologicism.Neil Tennant - 2013 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • An ordinal analysis for theories of self-referential truth.Graham Emil Leigh & Michael Rathjen - 2010 - Archive for Mathematical Logic 49 (2):213-247.
    The first attempt at a systematic approach to axiomatic theories of truth was undertaken by Friedman and Sheard (Ann Pure Appl Log 33:1–21, 1987). There twelve principles consisting of axioms, axiom schemata and rules of inference, each embodying a reasonable property of truth were isolated for study. Working with a base theory of truth conservative over PA, Friedman and Sheard raised the following questions. Which subsets of the Optional Axioms are consistent over the base theory? What are the proof-theoretic strengths (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Set existence principles and closure conditions: unravelling the standard view of reverse mathematics.Benedict Eastaugh - 2019 - Philosophia Mathematica 27 (2):153-176.
    It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the powerset of (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Infinite Lotteries, Spinners, Applicability of Hyperreals†.Emanuele Bottazzi & Mikhail G. Katz - 2021 - Philosophia Mathematica 29 (1):88-109.
    We analyze recent criticisms of the use of hyperreal probabilities as expressed by Pruss, Easwaran, Parker, and Williamson. We show that the alleged arbitrariness of hyperreal fields can be avoided by working in the Kanovei–Shelah model or in saturated models. We argue that some of the objections to hyperreal probabilities arise from hidden biases that favor Archimedean models. We discuss the advantage of the hyperreals over transferless fields with infinitesimals. In Paper II we analyze two underdetermination theorems by Pruss and (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Some Notes on Truths and Comprehension.Thomas Schindler - 2018 - Journal of Philosophical Logic 47 (3):449-479.
    In this paper we study several translations that map models and formulae of the language of second-order arithmetic to models and formulae of the language of truth. These translations are useful because they allow us to exploit results from the extensive literature on arithmetic to study the notion of truth. Our purpose is to present these connections in a systematic way, generalize some well-known results in this area, and to provide a number of new results. Sections 3 and 4 contain (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
    is a fragment of first-order aritlimetic so weak that it cannot prove the totality of an iterated exponential fimction. Surprisingly, however, the theory is remarkably robust. I will discuss formal results that show that many theorems of number theory and combinatorics are derivable in elementary arithmetic, and try to place these results in a broader philosophical context.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts.Kentaro Sato - 2022 - Archive for Mathematical Logic 61 (3):399-435.
    In his previous work, the author has introduced the axiom schema of inductive dichotomy, a weak variant of the axiom schema of inductive definition, and used this schema for elementary ) positive operators to separate open and clopen determinacies for those games in which two players make choices from infinitely many alternatives in various circumstances. Among the studies on variants of inductive definitions for bounded ) positive operators, the present article investigates inductive dichotomy for these operators, and applies it to (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Reverse mathematics and Peano categoricity.Stephen G. Simpson & Keita Yokoyama - 2013 - Annals of Pure and Applied Logic 164 (3):284-293.
    We investigate the reverse-mathematical status of several theorems to the effect that the natural number system is second-order categorical. One of our results is as follows. Define a system to be a triple A,i,f such that A is a set and i∈A and f:A→A. A subset X⊆A is said to be inductive if i∈X and ∀a ∈X). The system A,i,f is said to be inductive if the only inductive subset of A is A itself. Define a Peano system to be (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Truth and reduction.Volker Halbach - 2000 - Erkenntnis 53 (1-2):97-126.
    The proof-theoretic results on axiomatic theories oftruth obtained by different authors in recent years are surveyed.In particular, the theories of truth are related to subsystems ofsecond-order analysis. On the basis of these results, thesuitability of axiomatic theories of truth for ontologicalreduction is evaluated.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • A Note on Typed Truth and Consistency Assertions.Carlo Nicolai - 2016 - Journal of Philosophical Logic 45 (1):89-119.
    In the paper we investigate typed axiomatizations of the truth predicate in which the axioms of truth come with a built-in, minimal and self-sufficient machinery to talk about syntactic aspects of an arbitrary base theory. Expanding previous works of the author and building on recent works of Albert Visser and Richard Heck, we give a precise characterization of these systems by investigating the strict relationships occurring between them, arithmetized model constructions in weak arithmetical systems and suitable set existence axioms. The (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The Potential in Frege’s Theorem.Will Stafford - 2023 - Review of Symbolic Logic 16 (2):553-577.
    Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Forcing in proof theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.
    Paul Cohen’s method of forcing, together with Saul Kripke’s related semantics for modal and intuitionistic logic, has had profound effects on a number of branches of mathematical logic, from set theory and model theory to constructive and categorical logic. Here, I argue that forcing also has a place in traditional Hilbert-style proof theory, where the goal is to formalize portions of ordinary mathematics in restricted axiomatic theories, and study those theories in constructive or syntactic terms. I will discuss the aspects (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Admissible extensions of subtheories of second order arithmetic.Gerhard Jäger & Michael Rathjen - 2024 - Annals of Pure and Applied Logic 175 (7):103425.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A general theory of abstraction operators.Neil Tennant - 2004 - Philosophical Quarterly 54 (214):105-133.
    I present a general theory of abstraction operators which treats them as variable-binding term- forming operators, and provides a reasonably uniform treatment for definite descriptions, set abstracts, natural number abstraction, and real number abstraction. This minimizing, extensional and relational theory reveals a striking similarity between definite descriptions and set abstracts, and provides a clear rationale for the claim that there is a logic of sets (which is ontologically non- committal). The theory also treats both natural and real numbers as answering (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Unifying the model theory of first-order and second-order arithmetic via WKL 0 ⁎.Ali Enayat & Tin Lok Wong - 2017 - Annals of Pure and Applied Logic 168 (6):1247-1283.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Models and Computability.W. Dean - 2014 - Philosophia Mathematica 22 (2):143-166.
    Computationalism holds that our grasp of notions like ‘computable function’ can be used to account for our putative ability to refer to the standard model of arithmetic. Tennenbaum's Theorem has been repeatedly invoked in service of this claim. I will argue that not only do the relevant class of arguments fail, but that the result itself is most naturally understood as having the opposite of a reference-fixing effect — i.e., rather than securing the determinacy of number-theoretic reference, Tennenbaum's Theorem points (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Boolos and the Metamathematics of Quine's Definitions of Logical Truth and Consequence.Günther Eder - 2016 - History and Philosophy of Logic 37 (2):170-193.
    The paper is concerned with Quine's substitutional account of logical truth. The critique of Quine's definition tends to focus on miscellaneous odds and ends, such as problems with identity. However, in an appendix to his influential article On Second Order Logic, George Boolos offered an ingenious argument that seems to diminish Quine's account of logical truth on a deeper level. In the article he shows that Quine's substitutional account of logical truth cannot be generalized properly to the general concept of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • The strength of infinitary Ramseyan principles can be accessed by their densities.Andrey Bovykin & Andreas Weiermann - 2017 - Annals of Pure and Applied Logic 168 (9):1700-1709.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • From hierarchies to well-foundedness.Dandolo Flumini & Kentaro Sato - 2014 - Archive for Mathematical Logic 53 (7-8):855-863.
    We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies have been extensively studied, we point out that well-foundedness is a necessary condition for the existence of hierarchies e.g. that even in an intuitionistic setting α⊢wfwhereα\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${_\alpha \vdash \mathsf{wf}\, {\rm where}\, _\alpha}$$\end{document} stands for the iteration of Π10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.
    We study the effective and proof-theoretic content of the polarized Ramsey’s theorem, a variant of Ramsey’s theorem obtained by relaxing the definition of homogeneous set. Our investigation yields a new characterization of Ramsey’s theorem in all exponents, and produces several combinatorial principles which, modulo bounding for ${\Sigma^0_2}$ formulas, lie (possibly not strictly) between Ramsey’s theorem for pairs and the stable Ramsey’s theorem for pairs.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The strength of compactness in Computability Theory and Nonstandard Analysis.Dag Normann & Sam Sanders - 2019 - Annals of Pure and Applied Logic 170 (11):102710.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The Metamathematics of Putnam’s Model-Theoretic Arguments.Tim Button - 2011 - Erkenntnis 74 (3):321-349.
    Putnam famously attempted to use model theory to draw metaphysical conclusions. His Skolemisation argument sought to show metaphysical realists that their favourite theories have countable models. His permutation argument sought to show that they have permuted models. His constructivisation argument sought to show that any empirical evidence is compatible with the Axiom of Constructibility. Here, I examine the metamathematics of all three model-theoretic arguments, and I argue against Bays (2001, 2007) that Putnam is largely immune to metamathematical challenges.
    Download  
     
    Export citation  
     
    Bookmark   6 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  
  • Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.
    We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion (ATR_0) from the point of view of computability-theoretic reducibilities, in particular Weihrauch reducibility. Our main result states that it is equally hard to construct an embedding between two given well-orderings, as it is to construct a Turing jump hierarchy on a given well-ordering. This answers a question of Marcone. We obtain a similar result for Fraïssé's conjecture restricted to well-orderings.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Reverse formalism 16.Sam Sanders - 2020 - Synthese 197 (2):497-544.
    In his remarkable paper Formalism 64, Robinson defends his eponymous position concerning the foundations of mathematics, as follows:Any mention of infinite totalities is literally meaningless.We should act as if infinite totalities really existed. Being the originator of Nonstandard Analysis, it stands to reason that Robinson would have often been faced with the opposing position that ‘some infinite totalities are more meaningful than others’, the textbook example being that of infinitesimals. For instance, Bishop and Connes have made such claims regarding infinitesimals, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Reverse mathematics and the equivalence of definitions for well and better quasi-orders.Peter Cholak, Alberto Marcone & Reed Solomon - 2004 - Journal of Symbolic Logic 69 (3):683-712.
    Download  
     
    Export citation  
     
    Bookmark   12 citations