Results for 'absolute provability'

964 found
Order:
  1. Note on Absolute Provability and Cantorian Comprehension.Holger A. Leuz - manuscript
    We will explicate Cantor’s principle of set existence using the Gödelian intensional notion of absolute provability and John Burgess’ plural logical concept of set formation. From this Cantorian Comprehension principle we will derive a conditional result about the question whether there are any absolutely unprovable mathematical truths. Finally, we will discuss the philosophical significance of the conditional result.
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  71
    Absolute probability functions for intuitionistic propositional logic.Peter Roeper & Hugues Leblanc - 1999 - Journal of Philosophical Logic 28 (3):223-234.
    Provided here is a characterisation of absolute probability functions for intuitionistic (propositional) logic L, i.e. a set of constraints on the unary functions P from the statements of L to the reals, which insures that (i) if a statement A of L is provable in L, then P(A) = 1 for every P, L's axiomatisation being thus sound in the probabilistic sense, and (ii) if P(A) = 1 for every P, then A is provable in L, L's axiomatisation being (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3. 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  
  4. Proofs, necessity and causality.Srećko Kovač - 2019 - In Enrique Alonso, Antonia Huertas & Andrei Moldovan (eds.), Aventuras en el Mundo de la Lógica: Ensayos en Honor a María Manzano. College Publications. pp. 239-263.
    There is a long tradition of logic, from Aristotle to Gödel, of understanding a proof from the concepts of necessity and causality. Gödel's attempts to define provability in terms of necessity led him to the distinction of formal and absolute (abstract) provability. Turing's definition of mechanical procedure by means of a Turing machine (TM) and Gödel's definition of a formal system as a mechanical procedure for producing formulas prompt us to understand formal provability as a mechanical (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  5.  43
    Godel's Disjunction: The Scope and Limits of Mathematical Knowledge.Leon Horsten & Philip Welch (eds.) - 2016 - Oxford, England: Oxford University Press UK.
    The logician Kurt Godel in 1951 established a disjunctive thesis about the scope and limits of mathematical knowledge: either the mathematical mind is equivalent to a Turing machine (i.e., a computer), or there are absolutely undecidable mathematical problems. In the second half of the twentieth century, attempts have been made to arrive at a stronger conclusion. In particular, arguments have been produced by the philosopher J.R. Lucas and by the physicist and mathematician Roger Penrose that intend to show that the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  6.  35
    Truth, Existence and Explanation: Filmat 2016 Studies in the Philosophy of Mathematics.Gabriele Pulcini & Mario Piazza (eds.) - 2018 - Cham, Switzerland: Springer Verlag.
    This book contains more than 15 essays that explore issues in truth, existence, and explanation. It features cutting-edge research in the philosophy of mathematics and logic. Renowned philosophers, mathematicians, and younger scholars provide an insightful contribution to the lively debate in this interdisciplinary field of inquiry. The essays look at realism vs. anti-realism as well as inflationary vs. deflationary theories of truth. The contributors also consider mathematical fictionalism, structuralism, the nature and role of axioms, constructive existence, and generality. In addition, (...)
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  7. On the Question of Whether the Mind Can Be Mechanized, II: Penrose’s New Argument.Peter Koellner - 2018 - Journal of Philosophy 115 (9):453-484.
    Gödel argued that his incompleteness theorems imply that either “the mind cannot be mechanized” or “there are absolutely undecidable sentences.” In the precursor to this paper I examined the early arguments for the first disjunct. In the present paper I examine the most sophisticated argument for the first disjunct, namely, Penrose’s new argument. It turns out that Penrose’s argument requires a type-free notion of truth and a type-free notion of absolute provability. I show that there is a natural (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  8. Descriptions and unknowability.Jan Heylen - 2010 - Analysis 70 (1):50-52.
    In a recent paper Horsten embarked on a journey along the limits of the domain of the unknowable. Rather than knowability simpliciter, he considered a priori knowability, and by the latter he meant absolute provability, i.e. provability that is not relativized to a formal system. He presented an argument for the conclusion that it is not absolutely provable that there is a natural number of which it is true but absolutely unprovable that it has a certain property. (...)
    Direct download (14 more)  
     
    Export citation  
     
    Bookmark   21 citations  
  9. An argument concerning the unknowable.Leon Horsten - 2009 - Analysis 69 (2):240-242.
    Williamson has forcefully argued that Fitch's argument shows that the domain of the unknowable is non-empty. And he exhorts us to make more inroads into the land of the unknowable. Concluding his discussion of Fitch's argument, he writes: " Once we acknowledge that [the domain of the unknowable] is non-empty, we can explore more effectively its extent. … We are only beginning to understand the deeper limits of our knowledge. " I shall formulate and evaluate a new argument concerning the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  10.  35
    Realization of Intuitionistic Logic by Proof Polynomials.Sergei N. Artemov - 1999 - Journal of Applied Non-Classical Logics 9 (2-3):285-301.
    ABSTRACT In 1933 Gödel introduced an axiomatic system, currently known as S4, for a logic of an absolute provability, i.e. not depending on the formalism chosen ([God 33]). The problem of finding a fair provability model for S4 was left open. The famous formal provability predicate which first appeared in the Gödel Incompleteness Theorem does not do this job: the logic of formal provability is not compatible with S4. As was discovered in [Art 95], this (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11. Paradoxes of Demonstrability.Sten Lindström - 2009 - In Lars-Göran Johansson, Jan Österberg & Rysiek Śliwiński (eds.), Logic, Ethics and All That Jazz: Essays in Honour of Jordan Howard Sobel. Uppsala: Dept. Of Philosophy, Uppsala University. 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 (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  25
    The Algorithmicity of Mathematical Cognition.Theodor Nenu - 2024 - Journal of Consciousness Studies 31 (7):74-85.
    This article purports to establish the philosophical inappropriateness of using established theorems in mathematical logic, such as Gödel's (1931) first incompleteness theorem, in order to conclude that human minds have a non-algorithmic nature. First, I will argue that the ongoing debate in the philosophy of mathematics concerning absolute provability is fully independent of the question whether our brains are biologically instantiated computers or not. Second, through a combination of evolutionary considerations and the phenomenon of vagueness, I will demonstrate (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  13.  43
    Absolutist array specification and species survival: An ecological perspective on ecological perception.Patrick A. Cabe - 2001 - Behavioral and Brain Sciences 24 (2):217-217.
    Stoffregen & Bardy propose an absolutist transmodal array structure model, intended to displace models of specification in all existing perceptual theories. Absolute specification of world structure in array structures, either unimodal or transmodal, may not be provable, but might be falsifiable. Absolute specification, moreover, may not be a necessary postulate in an ecological approach to understanding perception-action.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  14.  33
    Godel's theorem in retrospect.Martin Tabakov - 1984 - Bulletin of the Section of Logic 13 (3):132-134.
    G¨odel’s a theorem concerns an arithmetical statement and the truth of this statement does not depend on self-reference; nevertheless its interpretation is of tremendous interest. G¨odel’s theorem allows one to conclude that formal arithmetic is not axiomatizable. But there is another very interesting logico-philosophical result: the possibility of a statement to exist such that it is improvable in the object-theory and at the same time its truth is provable in the metatheory. It seems that in the real history G¨odel’s theorem (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  15. Tem: Of.Yehuda Rav - unknown
    Among the aims of the author in this wide-ranging article is to draw attention to the numerous formal sciences which so far have received little scrutiny, if at all, on the part of philosophers of mathematics and of science in general. By the formal sciences the author understands such mathematical disciplines as operations research, control theory, signal processing, cluster analysis, game theory, and so on. First, the author presents a long list of such formal sciences with a detailed discussion of (...)
    No categories
     
    Export citation  
     
    Bookmark  
  16.  40
    The Phrenetic Calculus: A Logician's View of Disordered Logical Thinking in Schizophrenia.Robert Klee - 1993 - Behavior and Philosophy 20 (2):49 - 61.
    This paper contains a preliminary investigation of an experimental, first-order logic with identity which encodes as an inference rule the faulty reasoning which Von Domarus (1944) suggested underwrote much of the bizarre thinking seen in certain forms of schizophrenia. I begin with a discussion of the "Von Domarus thesis," note its fate under statistical testing, and remark on its continued explanatory power in the hands of certain psychiatrists. I next discuss a proof calculus which contains a rule representing Von Domarus (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  17.  84
    The Revenge of Ecological Rationality: Strategy-Selection by Meta-Induction Within Changing Environments.Gerhard Schurz & Paul D. Thorn - 2016 - Minds and Machines 26 (1-2):31-59.
    According to the paradigm of adaptive rationality, successful inference and prediction methods tend to be local and frugal. As a complement to work within this paradigm, we investigate the problem of selecting an optimal combination of prediction methods from a given toolbox of such local methods, in the context of changing environments. These selection methods are called meta-inductive strategies, if they are based on the success-records of the toolbox-methods. No absolutely optimal MI strategy exists—a fact that we call the “revenge (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   17 citations  
  18. “The Rejection of Radical-Foundationalism and -Skepticism: Pragmatic Belief in God in Eliezer Berkovits’s Thought” [in Hebrew].Nadav Berman, S. - 2019 - Journal of the Goldstein-Goren International Center for Jewish Thought 1:201-246.
    Faith has many aspects. One of them is whether absolute logical proof for God’s existence is a prerequisite for the proper establishment and individual acceptance of a religious system. The treatment of this question, examined here in the Jewish context of Rabbi Prof. Eliezer Berkovits, has been strongly influenced in the modern era by the radical foundationalism and radical skepticism of Descartes, who rooted in the Western mind the notion that religion and religious issues are “all or nothing” questions. (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  19.  55
    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 self-interpretation (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  20.  79
    Preventive War and the Epistemological Dimension of the Morality of War.Randall R. Dipert - 2006 - Journal of Military Ethics 5 (1):32-54.
    This essay makes three claims about preventive war, which is demarcated from preemptive war and is part of a broader class of ?anticipatory? wars. Anticipatory wars, but especially preventive war, are ?hard cases? for traditional Just War theory; other puzzles for this tradition include nuclear deterrence, humanitarian intervention, and provability a priori of the success of Tit-for-Tat. First, and despite strong assertions to the contrary, it is far from clear that preventive war is absolutely prohibited in traditional Just War (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  21.  43
    Closed maximality principles: implications, separations and combinations.Gunter Fuchs - 2008 - Journal of Symbolic Logic 73 (1):276-308.
    l investigate versions of the Maximality Principles for the classes of forcings which are <κ-closed. <κ-directed-closed, or of the form Col (κ. <Λ). These principles come in many variants, depending on the parameters which are allowed. I shall write MPΓ(A) for the maximality principle for forcings in Γ, with parameters from A. The main results of this paper are: • The principles have many consequences, such as <κ-closed-generic $\Sigma _{2}^{1}(H_{\kappa})$ absoluteness, and imply. e.g., that ◇κ holds. I give an application (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  22.  3
    Infinite combinatorics revisited in the absence of Axiom of choice.Tamás Csernák & Lajos Soukup - forthcoming - Archive for Mathematical Logic:1-19.
    We investigate whether classical combinatorial theorems are provable in ZF. Some statements are not provable in ZF, but they are equivalent within ZF. For example, the following statements (i)–(iii) are equivalent: $$cf({\omega }_1)={\omega }_1$$ c f ( ω 1 ) = ω 1, $${\omega }_1\rightarrow ({\omega }_1,{\omega }+1)^2$$ ω 1 → ( ω 1, ω + 1 ) 2, any family $$\mathcal {A}\subset [{On}]^{<{\omega }}$$ A ⊂ [ On ] < ω of size $${\omega }_1$$ ω 1 contains a $$\Delta (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  23.  90
    Classless.Sam Roberts - 2020 - Analysis 80 (1):76-83.
    Classes are a kind of collection. Typically, they are too large to be sets. For example, there are classes containing absolutely all sets even though there is no set of all sets. But what are classes, if not sets? When our theory of classes is relatively weak, this question can be avoided. In particular, it is well known that von Neuman–Bernays–Godel class theory is conservative over the standard axioms of set theory ): anything NGB can prove about the sets is (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  24. Anselm W. Muller.Conceptual Surroundings Of Absolute - 1991 - In Harry A. Lewis (ed.), Peter Geach: Philosophical Encounters. Kluwer Academic Publishers. pp. 185.
     
    Export citation  
     
    Bookmark  
  25. La lucha por el reconocimiento en Hegel como prefiguración de la eticidad absoluta.Hegel as A. Prefiguration Of Absolute - 2007 - Ideas y Valores. Revista Colombiana de Filosofía 56 (133):95.
    No categories
     
    Export citation  
     
    Bookmark  
  26.  24
    Trinity and Spirit, DALE M. SCHLITT.Absolute Spirit Revisited & Physical Determinism - 1991 - American Philosophical Quarterly 28 (1).
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  27. Section 2. Model Theory.Va Vardanyan, On Provability Resembling Computability, Proving Aa Voronkov & Constructive Logic - 1989 - In Jens Erik Fenstad, Ivan Timofeevich Frolov & Risto Hilpinen (eds.), Logic, methodology, and philosophy of science VIII: proceedings of the Eighth International Congress of Logic, Methodology, and Philosophy of Science, Moscow, 1987. New York, NY, U.S.A.: Sole distributors for the U.S.A. and Canada, Elsevier Science.
    No categories
     
    Export citation  
     
    Bookmark  
  28.  7
    Approach, interactive, 203 approach, practice oriented, 86.Hegel’S. Absolute - 2012 - In Judith M. Green, Stefan Neubert & Kersten Reich (eds.), Pragmatism and diversity: Dewey in the context of late twentieth century debates. New York: Palgrave-Macmillan. pp. 75--233.
  29. Bas C. Van Fraassen.I. Absolute Obligations - 1973 - In Mario Bunge (ed.), Exact philosophy; problems, tools, and goals. Boston,: D. Reidel. pp. 50--151.
    No categories
     
    Export citation  
     
    Bookmark  
  30. Chapter outline.A. Personal, Corporate Indispensability, B. Personal, Corporate Infallibility, A. God—Humanism, C. Family—Career, D. Work—Leisure, E. Interdependence—Independence, I. Thrift—Debt & J. Absolute—Relative - forthcoming - Moral Management: Business Ethics.
    No categories
     
    Export citation  
     
    Bookmark  
  31. On formal and informal provability.Hannes Leitgeb - 2009 - In Ø. Linnebo O. Bueno (ed.), New Waves in Philosophy of Mathematics. Palgrave-Macmillan. pp. 263--299.
     
    Export citation  
     
    Bookmark   47 citations  
  32.  79
    The modal logic of provability. The sequential approach.Giovanni Sambin & Silvio Valentini - 1982 - Journal of Philosophical Logic 11 (3):311 - 342.
  33.  32
    Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.
    -/- Provability logic is a modal logic that is used to investigate what arithmetical theories can express in a restricted language about their provability predicates. The logic has been inspired by developments in meta-mathematics such as Gödel’s incompleteness theorems of 1931 and Löb’s theorem of 1953. As a modal logic, provability logic has been studied since the early seventies, and has had important applications in the foundations of mathematics. -/- From a philosophical point of view, provability (...)
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  34.  34
    Absolute timing of mental activities.Gerald S. Wasserman & King-Leung Kong - 1979 - Behavioral and Brain Sciences 2 (2):243-255.
  35.  21
    (1 other version)The Σ1-Provability Logic of HA.Mohammad Ardeshir & Mojtaba Mojtahedi - forthcoming - Journal of Symbolic Logic:1-18.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  25
    Dialogues, strategies, and intuitionistic provability.Walter Felscher - 1985 - Annals of Pure and Applied Logic 28 (3):217-254.
  37.  84
    Finite Kripke models and predicate logics of provability.Sergei Artemov & Giorgie Dzhaparidze - 1990 - Journal of Symbolic Logic 55 (3):1090-1098.
    The paper proves a predicate version of Solovay's well-known theorem on provability interpretations of modal logic: If a closed modal predicate-logical formula R is not valid in some finite Kripke model, then there exists an arithmetical interpretation f such that $PA \nvdash fR$ . This result implies the arithmetical completeness of arithmetically correct modal predicate logics with the finite model property (including the one-variable fragments of QGL and QS). The proof was obtained by adding "the predicate part" as a (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  38. Absolute necessities.Bob Hale - 1996 - Philosophical Perspectives 10:93 - 117.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   65 citations  
  39.  78
    (1 other version)On Absolute Becoming and the Myth of Passage.Steven F. Savitt - 2002 - Royal Institute of Philosophy Supplement 50:153-167.
    J. M. E. McTaggart, in a famous argument, denied the reality of time because he thought that passage or temporal becoming was essential for the existence of time and that passage was a self-contradictory concept. This denial of passage has provoked a vast literature, two of the most important contributions being C. D. Broad’s painstaking defence of passage in his Examination of McTaggart’s Philosophy and D. C. Williams’ dazzling condemnation of it “The Myth of Passage.” -/- A careful reading of (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   61 citations  
  40.  28
    On the complexity of the closed fragment of Japaridze’s provability logic.Fedor Pakhomov - 2014 - Archive for Mathematical Logic 53 (7-8):949-967.
    We consider the well-known provability logic GLP. We prove that the GLP-provability problem for polymodal formulas without variables is PSPACE-complete. For a number n, let L0n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${L^{n}_0}$$\end{document} denote the class of all polymodal variable-free formulas without modalities ⟨n⟩,⟨n+1⟩,...\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\langle n \rangle,\langle n+1\rangle,...}$$\end{document}. We show that, for every number n, the GLP-provability problem for formulas from L0n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  41.  38
    Axiomatization of provable n-provability.Evgeny Kolmakov & Lev Beklemishev - 2019 - Journal of Symbolic Logic 84 (2):849-869.
  42. Absolute Creation.Thomas V. Morris & Christopher Menzel - 1986 - American Philosophical Quarterly 23 (4):353 - 362.
  43.  81
    Truth, Conservativeness, and Provability: Reply to Cieslinski.J. Ketland - 2010 - Mind 119 (474):423-436.
    Cieslinski has given an interesting response to Shapiro 1998 and Ketland 1999, which argued that deflationary truth theories are inadequate, since they lack the property of ‘reflective adequacy’. Cieslinski’s response, following Tennant (2002, 2005), aims to explain, without a detour using truth axioms, why someone who accepts the axioms of a theory should also accept its reflection principles. The argument is formulated very clearly (in fact, to justify a different reflection principle), and involves a couple of important assumptions, the crucial (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  44.  50
    A note of provability, truth and existence.Arnon Avron - 1991 - Journal of Philosophical Logic 20 (4):403 - 409.
  45.  48
    (1 other version)Bergson and absolute idealism (II.).S. Radhakrishnan - 1919 - Mind 28 (111):275-296.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  46. A purely syntactic and cut-free sequent calculus for the modal logic of provability.Francesca Poggiolesi - 2009 - Review of Symbolic Logic 2 (4):593-611.
    In this paper we present a sequent calculus for the modal propositional logic GL (the logic of provability) obtained by means of the tree-hypersequent method, a method in which the metalinguistic strength of hypersequents is improved, so that we can simulate trees shapes. We prove that this sequent calculus is sound and complete with respect to the Hilbert-style system GL, that it is contraction free and cut free and that its logical and modal rules are invertible. No explicit semantic (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  47.  80
    An Inside View of Exp; or, The Closed Fragment of the Provability Logic of IΔ0+ Ω1 with a Propositional Constant for.Albert Visser - 1992 - Journal of Symbolic Logic 57 (1):131-165.
    In this paper I give a characterization of the closed fragment of the provability logic of $I \triangle_0 + \mathrm{EXP}$ with a propositional constant for $\mathrm{EXP}$. In three appendices many details on arithmetization are provided.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  48.  78
    On propositional quantifiers in provability logic.Sergei N. Artemov & Lev D. Beklemishev - 1993 - Notre Dame Journal of Formal Logic 34 (3):401-419.
  49.  39
    A unification-theoretic method for investigating the k-provability problem.William M. Farmer - 1991 - Annals of Pure and Applied Logic 51 (3):173-214.
    The k-provability for an axiomatic system A is to determine, given an integer k 1 and a formula in the language of A, whether or not there is a proof of in A containing at most k lines. In this paper we develop a unification-theoretic method for investigating the k-provability problem for Parikh systems, which are first-order axiomatic systems that contain a finite number of axiom schemata and a finite number of rules of inference. We show that the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  50. Are single moral rules absolute in Kant's ethics?Jussi Tenkku - 1967 - Jyväskylä [Finland]: Jyväskylän Yliopisto.
     
    Export citation  
     
    Bookmark  
1 — 50 / 964