Results for ' provability of statements'

997 found
Order:
  1. On deciding the provability of certain fixed point statements.George Boolos - 1977 - Journal of Symbolic Logic 42 (2):191-193.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  2.  28
    Classical provability of uniform versions and intuitionistic provability.Makoto Fujiwara & Ulrich Kohlenbach - 2015 - Mathematical Logic Quarterly 61 (3):132-150.
    Along the line of Hirst‐Mummert and Dorais, we analyze the relationship between the classical provability of uniform versions Uni(S) of Π2‐statements S with respect to higher order reverse mathematics and the intuitionistic provability of S. Our main theorem states that (in particular) for every Π2‐statement S of some syntactical form, if its uniform version derives the uniform variant of over a classical system of arithmetic in all finite types with weak extensionality, then S is not provable in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3. Arithmetical Reflection and the Provability of Soundness.Walter Dean - 2015 - Philosophia Mathematica 23 (1):31-64.
    Proof-theoretic reflection principles are schemas which attempt to express the soundness of arithmetical theories within their own language, e.g., ${\mathtt{{Prov}_{\mathsf {PA}} \rightarrow \varphi }}$ can be understood to assert that any statement provable in Peano arithmetic is true. It has been repeatedly suggested that justification for such principles follows directly from acceptance of an arithmetical theory $\mathsf {T}$ or indirectly in virtue of their derivability in certain truth-theoretic extensions thereof. This paper challenges this consensus by exploring relationships between reflection principles (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  4.  54
    Provability logics for natural Turing progressions of arithmetical theories.L. D. Beklemishev - 1991 - Studia Logica 50 (1):107 - 128.
    Provability logics with many modal operators for progressions of theories obtained by iterating their consistency statements are introduced. The corresponding arithmetical completeness theorem is proved.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  5.  8
    Variants of Kreisel’s Conjecture on a New Notion of Provability.Paulo Guilherme Santos & Reinhard Kahle - 2021 - Bulletin of Symbolic Logic 27 (4):337-350.
    Kreisel’s conjecture is the statement: if, for all$n\in \mathbb {N}$,$\mathop {\text {PA}} \nolimits \vdash _{k \text { steps}} \varphi (\overline {n})$, then$\mathop {\text {PA}} \nolimits \vdash \forall x.\varphi (x)$. For a theory of arithmeticT, given a recursive functionh,$T \vdash _{\leq h} \varphi $holds if there is a proof of$\varphi $inTwhose code is at most$h(\#\varphi )$. This notion depends on the underlying coding.${P}^h_T(x)$is a predicate for$\vdash _{\leq h}$inT. It is shown that there exist a sentence$\varphi $and a total recursive functionhsuch that$T\vdash (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  7
    Professor Lejewski is opposed to the idea that the ontological commitments of an individual, or of a theory, are to be gauged by the existential assertions made by the former, or by the existential statements provable in the latter. Here, of course.Michael Dummett - 1976 - In J. P. Cleave & Stephan Körner (eds.), Philosophy of Logic: Papers and Discussions. University of California Press. pp. 28.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  7.  19
    Systems of iterated projective ordinal notations and combinatorial statements about binary labeled trees.L. Gordeev - 1989 - Archive for Mathematical Logic 29 (1):29-46.
    We introduce the appropriate iterated version of the system of ordinal notations from [G1] whose order type is the familiar Howard ordinal. As in [G1], our ordinal notations are partly inspired by the ideas from [P] where certain crucial properties of the traditional Munich' ordinal notations are isolated and used in the cut-elimination proofs. As compared to the corresponding “impredicative” Munich' ordinal notations (see e.g. [B1, B2, J, Sch1, Sch2, BSch]), our ordinal notations arearbitrary terms in the appropriate simple term (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  33
    Underdetermination and provability: a reply to Olaf Müller.Timm Lampert - 2017 - British Journal for the History of Philosophy 25 (2):389-400.
    Newton claims to have proven the heterogeneity of light through his experimentum crucis. However, Olaf Müller has worked out in detail Goethe’s idea that one could likewise prove the heterogeneity of darkness by inverting Newton’s famous experiment. Müller concludes that this invalidates Newton’s claim of proof. Yet this conclusion only holds if the heterogeneity of light and the heterogeneity of darkness is logically incompatible. This paper shows that this is not the case. Instead, in Quine’s terms, we have two logically (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  48
    Consistency statements and iterations of computable functions in IΣ1 and PRA.Joost J. Joosten - 2010 - Archive for Mathematical Logic 49 (7-8):773-798.
    In this paper we will state and prove some comparative theorems concerning PRA and IΣ1. We shall provide a characterization of IΣ1 in terms of PRA and iterations of a class of functions. In particular, we prove that for this class of functions the difference between IΣ1 and PRA is exactly that, where PRA is closed under iterations of these functions, IΣ1 is moreover provably closed under iteration. We will formulate a sufficient condition for a model of PRA to be (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  10. Identity statements and the necessary a posteriori.Helen Steward - 1990 - Journal of Philosophy 87 (8):385-398.
    There is a form of argument for a certain kind of essentialist conclusion which appears not to depend upon any appeal to intuition. Identity statements involving natural kind terms are often adverted to in the literature as examples of the necessary a posteriori, and it can appear as though the essentialist is on very strong ground with respect to these claims. It is not merely that they are apt to strike one as plausible in the light of philosophical arguments (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  11.  20
    Münchhausen provability.Joost J. Joosten - 2021 - Journal of Symbolic Logic 86 (3):1006-1034.
    By Solovay’s celebrated completeness result [31] on formal provability we know that the provability logic ${\textbf {GL}}$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable axiomatisation. Japaridze generalised this result in [22] by considering a polymodal version ${\mathsf {GLP}}$ of ${\textbf {GL}}$ with modalities $[n]$ for each natural number n referring to ever increasing notions of provability. Modern treatments of ${\mathsf {GLP}}$ tend to interpret the $[n]$ provability (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  12.  19
    Structuralism and informal provability.Georg Schiemer & John Wigglesworth - 2023 - Synthese 202 (2):1-26.
    Mathematical structuralism can be understood as a theory of mathematical ontology, of the objects that mathematics is about. It can also be understood as a theory of the semantics for mathematical discourse, of how and to what mathematical terms refer. In this paper we propose an epistemological interpretation of mathematical structuralism. According to this interpretation, the main epistemological claim is that mathematical knowledge is purely structural in character; mathematical statements contain purely structural information. To make this more precise, we (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  13.  19
    Mathematics of Modality.Robert Goldblatt - 1993 - Center for the Study of Language and Information Publications.
    Modal logic is the study of modalities - expressions that qualify assertions about the truth of statements - like the ordinary language phrases necessarily, possibly, it is known/believed/ought to be, etc., and computationally or mathematically motivated expressions like provably, at the next state, or after the computation terminates. The study of modalities dates from antiquity, but has been most actively pursued in the last three decades, since the introduction of the methods of Kripke semantics, and now impacts on a (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   34 citations  
  14.  11
    Acupuncture Points of Mathematical Education of Philosophers: Contexts of the Worldview of the New Century.V. A. Erovenko - 2014 - Liberal Arts in Russia 3 (6):457.
    The article examines the current state of the mathematical education of the students-philosophers that depends on language of the humanitarian mathematics, evidence of its statements and methodological problem of the cognition of the mathematical facts. One of important tasks of philosophy of mathematical education consists in motivation of the need for training mathematics of students-philosophers. The main criterion of the usefulness of mathematics for philosophers is revealed in the ways of justification of its truth and completeness of reasoning of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15.  30
    Characterizing the interpretation of set theory in Martin-Löf type theory.Michael Rathjen & Sergei Tupailo - 2006 - Annals of Pure and Applied Logic 141 (3):442-471.
    Constructive Zermelo–Fraenkel set theory, CZF, can be interpreted in Martin-Löf type theory via the so-called propositions-as-types interpretation. However, this interpretation validates more than what is provable in CZF. We now ask ourselves: is there a reasonably simple axiomatization of the set-theoretic formulae validated in Martin-Löf type theory? The answer is yes for a large collection of statements called the mathematical formulae. The validated mathematical formulae can be axiomatized by suitable forms of the axiom of choice.The paper builds on a (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  16.  19
    A herbrandized functional interpretation of classical first-order logic.Fernando Ferreira & Gilda Ferreira - 2017 - Archive for Mathematical Logic 56 (5-6):523-539.
    We introduce a new typed combinatory calculus with a type constructor that, to each type σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}, associates the star type σ∗\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma ^*$$\end{document} of the nonempty finite subsets of elements of type σ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document}. We prove that this calculus enjoys the properties of strong normalization and confluence. With the aid of this star combinatory (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  17.  55
    The coherence of antirealism.Charles McCarty - 2006 - Mind 115 (460):947-956.
    The project of antirealism is to construct an assertibility semantics on which (1) the truth of statements obeys a recognition condition so that (2) counterexamples are forthcoming to the law of the excluded third and (3) intuitionistic formal predicate logic is provably sound and complete with respect to the associated notion of validity. Using principles of intuitionistic mathematics and employing only intuitionistically correct inferences, we show that prima facie reasonable formulations of (1), (2), and (3) are inconsistent. Therefore, it (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  18.  7
    EΣTI TOY MEΣOY H ZHTHΣΙΣ: Der Begriff der» Mitte «in Aristoteles' Wissenschaftskonzeption.Paul Ziche - 2005 - Archiv für Begriffsgeschichte 47:9-24.
    The notion of a μέσον, formally defined as the «middle term« in a syllogism, plays a pivotal role in Aristotle's theory of scientific demonstrations in his Analytica Posteriora. It is via the μέσον that the distinctive traits of a demonstration – the employment of causal notions and of statements concerning the essence of things – enter into demonstrative syllogisms. This, however, raises problems with respect to the provability of statements concerning the essence of things that Aristotle seems (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  19. On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
    In this paper the modal operator "x is provable in Peano Arithmetic" is incorporated into first-order theories. A provability extension of a theory is defined. Presburger Arithmetic of addition, Skolem Arithmetic of multiplication, and some first order theories of partial consistency statements are shown to remain decidable after natural provability extensions. It is also shown that natural provability extensions of a decidable theory may be undecidable.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  20. A calculus for Belnap's logic in which each proof consists of two trees.Stefan Wintein & Reinhard Muskens - 2012 - Logique Et Analyse 220:643-656.
    In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a natural (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  21. Finitism = PRA? On a Thesis of W.W. Tait.Matthias Schirn & Karl-Georg Niebergall - 2005 - Reports on Mathematical Logic:3-24.
    In his paper `Finitism', W.W.~Tait maintained that the chief difficulty for everyone who wishes to understand Hilbert's conception of finitist mathematics is this: to specify the sense of the provability of general statements about the natural numbers without presupposing infinite totalities. Tait further argued that all finitist reasoning is essentially primitive recursive. In our paper, we attempt to show that his thesis ``The finitist functions are precisely the primitive recursive functions'' is disputable and that another, likewise defended by (...)
     
    Export citation  
     
    Bookmark  
  22. A Non-Inferentialist, Anti-Realistic Conception of Logical Truth and Falsity.Heinrich Wansing - 2012 - Topoi 31 (1):93-100.
    Anti-realistic conceptions of truth and falsity are usually epistemic or inferentialist. Truth is regarded as knowability, or provability, or warranted assertability, and the falsity of a statement or formula is identified with the truth of its negation. In this paper, a non-inferentialist but nevertheless anti-realistic conception of logical truth and falsity is developed. According to this conception, a formula (or a declarative sentence) A is logically true if and only if no matter what is told about what is told (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  23.  17
    Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.
    We define and study a new restricted consistency notion RCon ∗ for bounded arithmetic theories T 2 j . It is the strongest ∀ Π 1 b -statement over S 2 1 provable in T 2 j , similar to Con in Krajíček and Pudlák, 29) or RCon in Krajı́ček and Takeuti 107). The advantage of our notion over the others is that RCon ∗ can directly be used to construct models of T 2 j . We apply this by (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  24.  37
    Products of some special compact spaces and restricted forms of AC.Kyriakos Keremedis & Eleftherios Tachtsis - 2010 - Journal of Symbolic Logic 75 (3):996-1006.
    We establish the following results: 1. In ZF (i.e., Zermelo-Fraenkel set theory minus the Axiom of Choice AC), for every set I and for every ordinal number α ≥ ω, the following statements are equivalent: (a) The Tychonoff product of| α| many non-empty finite discrete subsets of I is compact. (b) The union of| α| many non-empty finite subsets of I is well orderable. 2. The statement: For every infinite set I, every closed subset of the Tychonoff product [0, (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  25.  69
    On the Strength of Ramsey's Theorem.David Seetapun & Theodore A. Slaman - 1995 - Notre Dame Journal of Formal Logic 36 (4):570-582.
    We show that, for every partition F of the pairs of natural numbers and for every set C, if C is not recursive in F then there is an infinite set H, such that H is homogeneous for F and C is not recursive in H. We conclude that the formal statement of Ramsey's Theorem for Pairs is not strong enough to prove , the comprehension scheme for arithmetical formulas, within the base theory , the comprehension scheme for recursive formulas. (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   49 citations  
  26. Solutions to the Knower Paradox in the Light of Haack’s Criteria.Mirjam de Vos, Rineke Verbrugge & Barteld Kooi - 2023 - Journal of Philosophical Logic 52 (4):1101-1132.
    The knower paradox states that the statement ‘We know that this statement is false’ leads to inconsistency. This article presents a fresh look at this paradox and some well-known solutions from the literature. Paul Égré discusses three possible solutions that modal provability logic provides for the paradox by surveying and comparing three different provability interpretations of modality, originally described by Skyrms, Anderson, and Solovay. In this article, some background is explained to clarify Égré’s solutions, all three of which (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27. Paradoxes of Demonstrability.Sten Lindström - 2009 - In Lars-Göran Johansson, Jan Österberg & Ryszard Sliwinski (eds.), Logic, Ethics and all that Jazz: Essays in Honour of Jordan Howard Sobel. Uppsala, Sverige: pp. 177-185.
    In this paper I consider two paradoxes that arise in connection with the concept of demonstrability, or absolute provability. I assume—for the sake of the argument—that there is an intuitive notion of demonstrability, which should not be conflated with the concept of formal deducibility in a (formal) system or the relativized concept of provability from certain axioms. Demonstrability is an epistemic concept: the rough idea is that a sentence is demonstrable if it is provable from knowable basic (“self-evident”) (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  28.  64
    The collapse of the Hilbert program: A variation on the gödelian theme.Saul A. Kripke - 2022 - Bulletin of Symbolic Logic 28 (3):413-426.
    The Hilbert program was actually a specific approach for proving consistency, a kind of constructive model theory. Quantifiers were supposed to be replaced by ε-terms. εxA(x) was supposed to denote a witness to ∃xA(x), or something arbitrary if there is none. The Hilbertians claimed that in any proof in a number-theoretic system S, each ε-term can be replaced by a numeral, making each line provable and true. This implies that S must not only be consistent, but also 1-consistent. Here we (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  29.  33
    Nonconstructive Properties of Well-Ordered T 2 topological Spaces.Kyriakos Keremedis & Eleftherios Tachtsis - 1999 - Notre Dame Journal of Formal Logic 40 (4):548-553.
    We show that none of the following statements is provable in Zermelo-Fraenkel set theory (ZF) answering the corresponding open questions from Brunner in ``The axiom of choice in topology'':(i) For every T2 topological space (X, T) if X is well-ordered, then X has a well-ordered base,(ii) For every T2 topological space (X, T), if X is well-ordered, then there exists a function f : X × W T such that W is a well-ordered set and f ({x} × W) (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  30.  14
    Fact Versus Opinion in US Defamation Law: A Corpus and Appraisal Analysis of Speaker Stance Toward Reputational Harm.Amanda Izes - 2023 - International Journal for the Semiotics of Law - Revue Internationale de Sémiotique Juridique 36 (3):1185-1216.
    Sitting at the nexus of unchanging constitutional rights, constantly evolving social norms, and tensions between federal and state justice systems, defamation law in the US is exceedingly complex. In this work, I focus on a single conceptual and practical problem amidst this network: the fact-opinion distinction. This distinction—developed largely as a result of US Supreme Court decisions _Gertz v. Robert Welch, Inc._ and _Milkovich v. Lorraine Journal Co._—states that, while opinions are protected under the First Amendment so long as they (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  31.  32
    Logical Revisionism: Logical Rules vs. Structural Rules.Fabrice Pataut - unknown
    As far as logic is concerned, the conclusion of Michael Dummett's manifestability argument is that intuitionistic logic, as first developed by Heyting, satisfies the semantic requirements of antirealism. The argument may be roughly sketched as follows: since we cannot manifest a grasp of possibly justification-transcendent truth conditions, we must countenance conditions which are such that, at least in principle and by the very nature of the case, we are able to recognize that they are satisfied whenever they are. Intuitionistic logic (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  32.  24
    The analytical completeness of Dzhaparidze's polymodal logics.George Boolos - 1993 - Annals of Pure and Applied Logic 61 (1-2):95-111.
    The bimodal provability logics of analysis for ordinary provability and provability by the ω-rule are shown to be fragments of certain ‘polymodal’ logics introduced by G.K. Dzhaparidze. In addition to modal axiom schemes expressing Löb's theorem for the two kinds of provability, the logics treated here contain a scheme expressing that if a statement is consistent, then the statement that it is consistent is provable by the ω-rule.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  33.  33
    Generalizations of the Kruskal-Friedman theorems.L. Gordeev - 1990 - Journal of Symbolic Logic 55 (1):157-181.
    Kruskal proved that finite trees are well-quasi-ordered by hom(e)omorphic embeddability. Friedman observed that this statement is not provable in predicative analysis. Friedman also proposed (see in [Simpson]) some stronger variants of the Kruskal theorem dealing with finite labeled trees under home(e)omorphic embeddability with a certain gap-condition, where labels are arbitrary finite ordinals from a fixed initial segment of ω. The corresponding limit statement, expressing that for all initial segments of ω these labeled trees are well-quasi-ordered, is provable in Π 1 (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34. Relational theories of euclidean space and Minkowski spacetime.Brent Mundy - 1983 - Philosophy of Science 50 (2):205-226.
    We here present explicit relational theories of a class of geometrical systems (namely, inner product spaces) which includes Euclidean space and Minkowski spacetime. Using an embedding approach suggested by the theory of measurement, we prove formally that our theories express the entire empirical content of the corresponding geometric theory in terms of empirical relations among a finite set of elements (idealized point-particles or events) thought of as embedded in the space. This result is of interest within the general phenomenalist tradition (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  35.  80
    A defense of Isaacson’s thesis, or how to make sense of the boundaries of finite mathematics.Pablo Dopico - 2024 - Synthese 203 (2):1-22.
    Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  36.  27
    Weak axioms of determinacy and subsystems of analysis II.Kazuyuki Tanaka - 1991 - Annals of Pure and Applied Logic 52 (1-2):181-193.
    In [10], we have shown that the statement that all ∑ 1 1 partitions are Ramsey is deducible over ATR 0 from the axiom of ∑ 1 1 monotone inductive definition,but the reversal needs П 1 1 - CA 0 rather than ATR 0 . By contrast, we show in this paper that the statement that all ∑ 0 2 games are determinate is also deducible over ATR 0 from the axiom of ∑ 1 1 monotone inductive definition, but the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   19 citations  
  37. Yablo sequences in truth theories.Cezary Cieśliński - 2013 - In K. Lodaya (ed.), Logic and Its Applications, Lecture Notes in Computer Science LNCS 7750. Springer. pp. 127--138.
    We investigate the properties of Yablo sentences and for- mulas in theories of truth. Questions concerning provability of Yablo sentences in various truth systems, their provable equivalence, and their equivalence to the statements of their own untruth are discussed and answered.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  38.  17
    A note on ordinal exponentiation and derivatives of normal functions.Anton Freund - 2020 - Mathematical Logic Quarterly 66 (3):326-335.
    Michael Rathjen and the present author have shown that ‐bar induction is equivalent to (a suitable formalization of) the statement that every normal function has a derivative, provably in. In this note we show that the base theory can be weakened to. Our argument makes crucial use of a normal function f with and. We shall also exhibit a normal function g with and.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  10
    Tychonoff products of compact spaces in ZF and closed ultrafilters.Kyriakos Keremedis - 2010 - Mathematical Logic Quarterly 56 (5):474-487.
    Let {: i ∈I } be a family of compact spaces and let X be their Tychonoff product. [MATHEMATICAL SCRIPT CAPITAL C] denotes the family of all basic non-trivial closed subsets of X and [MATHEMATICAL SCRIPT CAPITAL C]R denotes the family of all closed subsets H = V × Πmath imageXi of X, where V is a non-trivial closed subset of Πmath imageXi and QH is a finite non-empty subset of I. We show: Every filterbase ℋ ⊂ [MATHEMATICAL SCRIPT CAPITAL (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Biological dynamic farming — an occult form of alternative agriculture?Holger Kirchmann - 1994 - Journal of Agricultural and Environmental Ethics 7 (2):173-187.
    An analysis of the theory of biodynamic farming is presented. The founder of biological dynamic agriculture, the Austrian Rudolf Steiner, Ph.D., (1861–1925), introduced methods of preparation and use of eight compounds forming the nucleus of his agricultural theory. His instructions were based on insights and inner visions from spiritualistic exercises and not on agricultural experiments. His purpose was to show mankind a form of agriculture that enables not only the production of healthy foods but also the achievement of harmonious interactions (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  41. Теоремата на Мартин Льоб във философска интерпретация.Vasil Penchev - 2011 - Philosophical Alternatives 20 (4):142-152.
    А necessary and sllmcient condilion that а given proposition (о Ье provable in such а theory that allows (о Ье assigned to the proposition а Gödеl пunbег fог containing Реanо arithmetic is that Gödеl number itself. This is tlle sense о[ Martin LöЬ's theorem (1955). Now wе сan рut several philosophpllical questions. Is the Gödеl numbег of а propositional formula necessarily finite or onthe contrary? What would the Gödel number of а theorem be containing Реanо arithmetic itself? That is the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  42.  10
    Large Cardinals and the Continuum Hypothesis.Radek Honzik - 2018 - In Carolin Antos, Sy-David Friedman, Radek Honzik & Claudio Ternullo (eds.), The Hyperuniverse Project and Maximality. Basel, Switzerland: Birkhäuser. pp. 205-226.
    This is a survey paper which discusses the impact of large cardinals on provability of the Continuum Hypothesis. It was Gödel who first suggested that perhaps “strong axioms of infinity” could decide interesting set-theoretical statements independent over ZFC, such as CH. This hope proved largely unfounded for CH—one can show that virtually all large cardinals defined so far do not affect the status of CH. It seems to be an inherent feature of large cardinals that they do not (...)
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  43.  48
    A constructive formulation of Gleason's theorem.Helen Billinge - 1997 - Journal of Philosophical Logic 26 (6):661-670.
    In this paper I wish to show that we can give a statement of a restricted form of Gleason's Theorem that is classically equivalent to the standard formulation, but that avoids the counterexample that Hellman gives in "Gleason's Theorem is not Constructively Provable".
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  44.  20
    Definability theorems in normal extensions of the probability logic.Larisa L. Maksimova - 1989 - Studia Logica 48 (4):495-507.
    Three variants of Beth's definability theorem are considered. Let L be any normal extension of the provability logic G. It is proved that the first variant B1 holds in L iff L possesses Craig's interpolation property. If L is consistent, then the statement B2 holds in L iff L = G + {0}. Finally, the variant B3 holds in any normal extension of G.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  38
    Compact Metric Spaces and Weak Forms of the Axiom of Choice.E. Tachtsis & K. Keremedis - 2001 - Mathematical Logic Quarterly 47 (1):117-128.
    It is shown that for compact metric spaces the following statements are pairwise equivalent: “X is Loeb”, “X is separable”, “X has a we ordered dense subset”, “X is second countable”, and “X has a dense set G = ∪{Gn : n ∈ ω}, ∣Gn∣ < ω, with limn→∞ diam = 0”. Further, it is shown that the statement: “Compact metric spaces are weakly Loeb” is not provable in ZF0 , the Zermelo-Fraenkel set theory without the axiom of regularity, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  46. Mad Speculation and Absolute Inhumanism: Lovecraft, Ligotti, and the Weirding of Philosophy.Ben Woodard - 2011 - Continent 1 (1):3-13.
    continent. 1.1 : 3-13. / 0/ – Introduction I want to propose, as a trajectory into the philosophically weird, an absurd theoretical claim and pursue it, or perhaps more accurately, construct it as I point to it, collecting the ground work behind me like the Perpetual Train from China Mieville's Iron Council which puts down track as it moves reclaiming it along the way. The strange trajectory is the following: Kant's critical philosophy and much of continental philosophy which has followed, (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  47.  73
    What Finitism Could Not Be.Matthias Schirn & Karl-Georg Niebergall - 2003 - Critica 35 (103):43-68.
    In his paper "Finitism", W.W. Tait maintains that the chief difficulty for everyone who wishes to understand Hilbert's conception of finitist mathematics is this: to specify the sense of the provability of general statements about the natural numbers without presupposing infinite totalities. Tait further argues that all finitist reasoning is essentially primitive recursive. In this paper, we attempt to show that his thesis "The finitist functions are precisely the primitive recursive functions" is disputable and that another, likewise defended (...)
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  30
    New Relations and Separations of Conjectures About Incompleteness in the Finite Domain.Erfan Khaniki - 2022 - Journal of Symbolic Logic 87 (3):912-937.
    In [20] Krajíček and Pudlák discovered connections between problems in computational complexity and the lengths of first-order proofs of finite consistency statements. Later Pudlák [25] studied more statements that connect provability with computational complexity and conjectured that they are true. All these conjectures are at least as strong as $\mathsf {P}\neq \mathsf {NP}$ [23–25].One of the problems concerning these conjectures is to find out how tightly they are connected with statements about computational complexity classes. Results of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  23
    The Logic of Turing Progressions.Eduardo Hermo Reyes & Joost J. Joosten - 2020 - Notre Dame Journal of Formal Logic 61 (1):155-180.
    Turing progressions arise by iteratedly adding consistency statements to a base theory. Different notions of consistency give rise to different Turing progressions. In this paper we present a logic that generates exactly all relations that hold between these different Turing progressions given a particular set of natural consistency notions. Thus, the presented logic is proven to be arithmetically sound and complete for a natural interpretation, named the formalized Turing progressions interpretation.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  50. Justifications of statements, evaluations and norms in jurisprudence.Zygmunt Ziembiński - 2021 - In Paweł Kwiatkowski & Marek Smolak (eds.), Poznań School of Legal Theory. Leiden, The Netherlands: Brill | Rodopi.
     
    Export citation  
     
    Bookmark  
1 — 50 / 997