45 found
Order:
See also
Richard Zach
University of Calgary
  1.  57
    Rumfitt on Truth-Grounds, Negation, and Vagueness.Richard Zach - 2018 - Philosophical Studies 175 (8):2079-2089.
    In The Boundary Stones of Thought, Rumfitt defends classical logic against challenges from intuitionistic mathematics and vagueness, using a semantics of pre-topologies on possibilities, and a topological semantics on predicates, respectively. These semantics are suggestive but the characterizations of negation face difficulties that may undermine their usefulness in Rumfitt’s project.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Vagueness, Logic and Use: Four Experimental Studies on Vagueness.Phil Serchuk, Ian Hargreaves & Richard Zach - 2011 - Mind and Language 26 (5):540-573.
    Although arguments for and against competing theories of vagueness often appeal to claims about the use of vague predicates by ordinary speakers, such claims are rarely tested. An exception is Bonini et al. (1999), who report empirical results on the use of vague predicates by Italian speakers, and take the results to count in favor of epistemicism. Yet several methodological difficulties mar their experiments; we outline these problems and devise revised experiments that do not show the same results. We then (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  3. Heinrich Behmann's 1921 Lecture on the Decision Problem and the Algebra of Logic.Paolo Mancosu & Richard Zach - 2015 - Bulletin of Symbolic Logic 21 (2):164-187.
    Heinrich Behmann (1891-1970) obtained his Habilitation under David Hilbert in Göttingen in 1921 with a thesis on the decision problem. In his thesis, he solved - independently of Löwenheim and Skolem's earlier work - the decision problem for monadic second-order logic in a framework that combined elements of the algebra of logic and the newer axiomatic approach to logic then being developed in Göttingen. In a talk given in 1921, he outlined this solution, but also presented important programmatic remarks on (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  46
    First-Order Gödel Logics.Richard Zach, Matthias Baaz & Norbert Preining - 2007 - Annals of Pure and Applied Logic 147 (1):23-47.
    First-order Gödel logics are a family of finite- or infinite-valued logics where the sets of truth values V are closed subsets of [0,1] containing both 0 and 1. Different such sets V in general determine different Gödel logics GV (sets of those formulas which evaluate to 1 in every interpretation into V). It is shown that GV is axiomatizable iff V is finite, V is uncountable with 0 isolated in V, or every neighborhood of 0 in V is uncountable. Complete (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  5.  30
    Non-Analytic Tableaux for Chellas's Conditional Logic CK and Lewis's Logic of Counterfactuals VC.Richard Zach - 2018 - Australasian Journal of Logic 15 (3):609-628.
    Priest has provided a simple tableau calculus for Chellas's conditional logic Ck. We provide rules which, when added to Priest's system, result in tableau calculi for Chellas's CK and Lewis's VC. Completeness of these tableaux, however, relies on the cut rule.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6. The Development of Mathematical Logic From Russell to Tarski, 1900-1935.Paolo Mancosu, Richard Zach & Calixto Badesa - 2009 - In Leila Haaparanta (ed.), The Development of Modern Logic. Oxford University Press.
    The period from 1900 to 1935 was particularly fruitful and important for the development of logic and logical metatheory. This survey is organized along eight "itineraries" concentrating on historically and conceptually linked strands in this development. Itinerary I deals with the evolution of conceptions of axiomatics. Itinerary II centers on the logical work of Bertrand Russell. Itinerary III presents the development of set theory from Zermelo onward. Itinerary IV discusses the contributions of the algebra of logic tradition, in particular, Löwenheim (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  7.  77
    The Practice of Finitism: Epsilon Calculus and Consistency Proofs in Hilbert's Program.Richard Zach - 2003 - Synthese 137 (1-2):211 - 259.
    After a brief flirtation with logicism around 1917, David Hilbertproposed his own program in the foundations of mathematics in 1920 and developed it, in concert with collaborators such as Paul Bernays andWilhelm Ackermann, throughout the 1920s. The two technical pillars of the project were the development of axiomatic systems for everstronger and more comprehensive areas of mathematics, and finitisticproofs of consistency of these systems. Early advances in these areaswere made by Hilbert (and Bernays) in a series of lecture courses atthe (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  8.  78
    Hilbert’s Program.Richard Zach - 2003 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Center for the Study of Language and Information, Stanford University.
    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 (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  48
    The Epsilon Calculus.Jeremy Avigad & Richard Zach - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Center for the Study of Language and Information, Stanford University.
    The epsilon calculus is a logical formalism developed by David Hilbert in the service of his program in the foundations of mathematics. The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. Specifically, in the calculus, a term εx A denotes some x satisfying A(x), if there is one. In Hilbert's Program, the epsilon terms play the role of ideal elements; the aim of Hilbert's finitistic consistency proofs is to give a procedure which removes such terms (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  10.  64
    Kurt Gödel, Paper on the Incompleteness Theorems (1931).Richard Zach - 2004 - In Ivor Grattan-Guinness (ed.), Landmark Writings in Mathematics. Amsterdam: North-Holland. pp. 917-925.
    This chapter describes Kurt Gödel's paper on the incompleteness theorems. Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. It had been assumed that first-order number theory is complete in the sense that any sentence in the language of number theory would be either provable from the axioms or refutable. Gödel's first incompleteness theorem showed that this assumption was false: it states that there are sentences of number theory that are (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11. Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic.Richard Zach - 1999 - Bulletin of Symbolic Logic 5 (3):331-366.
    Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these results, focussing (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  12.  63
    Labeled Calculi and Finite-Valued Logics.Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach - 1998 - Studia Logica 61 (1):7-33.
    A general class of labeled sequent calculi is investigated, and necessary and sufficient conditions are given for when such a calculus is sound and complete for a finite -valued logic if the labels are interpreted as sets of truth values. Furthermore, it is shown that any finite -valued logic can be given an axiomatization by such a labeled calculus using arbitrary "systems of signs," i.e., of sets of truth values, as labels. The number of labels needed is logarithmic in the (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  13.  58
    The Epsilon Calculus and Herbrand Complexity.Georg Moser & Richard Zach - 2006 - Studia Logica 82 (1):133-155.
    Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand disjunctions of existential (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  14.  38
    Carnap’s Early Metatheory: Scope and Limits.Georg Schiemer, Richard Zach & Erich Reck - 2017 - Synthese 194 (1):33-65.
    In Untersuchungen zur allgemeinen Axiomatik and Abriss der Logistik, Carnap attempted to formulate the metatheory of axiomatic theories within a single, fully interpreted type-theoretic framework and to investigate a number of meta-logical notions in it, such as those of model, consequence, consistency, completeness, and decidability. These attempts were largely unsuccessful, also in his own considered judgment. A detailed assessment of Carnap’s attempt shows, nevertheless, that his approach is much less confused and hopeless than it has often been made out to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  15.  17
    Hilbert's 'Verunglückter Beweis', the First Epsilon Theorem, and Consistency Proofs.Richard Zach - 2004 - History and Philosophy of Logic 25 (2):79-94.
    In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert's programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert's epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert's first epsilon theorem and a certain ?general consistency result? due to Bernays. An analysis of the form of this so-called ?failed proof? (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  16.  44
    Effective Finite-Valued Approximations of General Propositional Logics.Matthias Baaz & Richard Zach - 2008 - In Arnon Avron, Nachum Dershowitz & Alexander Rabinovich (eds.), Pillars of Computer Science: Essays Dedicated to Boris (Boaz) Trakhtenbrot on the Occasion of His 85th Birthday. Berlin: Springer. pp. 107–129.
    Propositional logics in general, considered as a set of sentences, can be undecidable even if they have “nice” representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already intuitionistic logic is PSPACE-complete). On the other hand, finite-valued logics are computationally relatively simple—at worst NP. Moreover, finite-valued semantics are simple, and general methods for theorem proving exist. This raises the question to what extent and under what circumstances propositional logics represented in various ways can (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17. Hilbert's Program Then and Now.Richard Zach - 2007 - In Dale Jacquette (ed.), Philosophy of Logic. Amsterdam: North Holland. pp. 411–447.
    Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  18.  32
    Completeness of a First-Order Temporal Logic with Time-Gaps.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - Theoretical Computer Science 160 (1-2):241-270.
    The first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete linear time) and trees of ω-segments (linear time with branching gaps) and some of its fragments are compared: the first is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  19.  31
    Kurt Gödel and Computability Theory.Richard Zach - 2006 - In Arnold Beckmann, Ulrich Berger, Benedikt Löwe & John V. Tucker (eds.), Logical Approaches to Computational Barriers. Second Conference on Computability in Europe, CiE 2006, Swansea. Proceedings. Berlin: Springer. pp. 575--583.
    Although Kurt Gödel does not figure prominently in the history of computabilty theory, he exerted a significant influence on some of the founders of the field, both through his published work and through personal interaction. In particular, Gödel’s 1931 paper on incompleteness and the methods developed therein were important for the early development of recursive function theory and the lambda calculus at the hands of Church, Kleene, and Rosser. Church and his students studied Gödel 1931, and Gödel taught a seminar (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  29
    Dual Systems of Sequents and Tableaux for Many-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Bulletin of the EATCS 51:192-197.
    The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of a truth value and (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  29
    Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic.Matthias Baaz & Richard Zach - 2000 - In Peter G. Clote & Helmut Schwichtenberg (eds.), Computer Science Logic. 14th International Workshop, CSL 2000. Berlin: Springer. pp. 187– 201.
    Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Gödel logics by Avron. It is shown that the system is sound and complete, and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  13
    Elimination of Cuts in First-Order Finite-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1994 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
    A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.
    Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  23.  28
    Algorithmic Structuring of Cut-Free Proofs.Matthias Baaz & Richard Zach - 1993 - In Egon Börger, Hans Kleine Büning, Gerhard Jäger, Simone Martini & Michael M. Richter (eds.), Computer Science Logic. CSL’92, San Miniato, Italy. Selected Papers. Berlin: Springer. pp. 29–42.
    The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB ( LK where blocks of quantifiers can be introduced in one step) is investigated, where a distinction is made between linear proofs and proofs in tree form. In this framework, structuring coincides with the introduction of cuts into a proof. The algorithmic solvability of this problem can be reduced to the question of k-l-compressibility: "Given a proof of length k , and l ≤ k : Is (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  24.  31
    Quantified Propositional Gödel Logics.Matthias Baaz, Agata Ciabattoni & Richard Zach - 2000 - In Andrei Voronkov & Michel Parigot (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Berlin: Springer. pp. 240-256.
    It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.
    Direct download  
     
    Export citation  
     
    Bookmark  
  25.  25
    Short Proofs of Tautologies Using the Schema of Equivalence.Matthias Baaz & Richard Zach - 1994 - In Egon Börger, Yuri Gurevich & Karl Meinke (eds.), Computer Science Logic. 7th Workshop, CSL '93, Swansea. Selected Papers. Berlin: Springer. pp. 33-35.
    It is shown how the schema of equivalence can be used to obtain short proofs of tautologies A , where the depth of proofs is linear in the number of variables in A .
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  26.  28
    Numbers and Functions in Hilbert's Finitism.Richard Zach - 1998 - Taiwanese Journal for History and Philosophy of Science 10:33-60.
    David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which have so far received (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  27.  70
    Natural Deduction for the Sheffer Stroke and Peirce’s Arrow (and Any Other Truth-Functional Connective).Richard Zach - 2016 - Journal of Philosophical Logic 45 (2):183-197.
    Methods available for the axiomatization of arbitrary finite-valued logics can be applied to obtain sound and complete intelim rules for all truth-functional connectives of classical logic including the Sheffer stroke and Peirce’s arrow. The restriction to a single conclusion in standard systems of natural deduction requires the introduction of additional rules to make the resulting systems complete; these rules are nevertheless still simple and correspond straightforwardly to the classical absurdity rule. Omitting these rules results in systems for intuitionistic versions of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  28.  27
    Systematic Construction of Natural Deduction Systems for Many-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - In Proceedings of The Twenty-Third International Symposium on Multiple-Valued Logic, 1993. Los Alamitos, CA: IEEE Press. pp. 208-213.
    A construction principle for natural deduction systems for arbitrary, finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness, and normal-form theorems for natural deduction systems.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  29.  24
    Incompleteness of a First-Order Gödel Logic and Some Temporal Logics of Programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Hans Kleine Büning (ed.), Computer Science Logic. CSL 1995. Selected Papers. Berlin: Springer. pp. 1--15.
    It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) and of the authors' temporal (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  20
    Completeness of a Hypersequent Calculus for Some First-Order Gödel Logics with Delta.Matthias Baaz, Norbert Preining & Richard Zach - 2006 - In 36th International Symposium on Multiple-valued Logic. May 2006, Singapore. Proceedings. Los Alamitos: IEEE Press.
    All first-order Gödel logics G_V with globalization operator based on truth value sets V C [0,1] where 0 and 1 lie in the perfect kernel of V are axiomatized by Ciabattoni’s hypersequent calculus HGIF.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  31.  54
    Critical Study of Michael Potter’s Reason’s Nearest Kin. [REVIEW]Richard Zach - 2005 - Notre Dame Journal of Formal Logic 46 (4):503-513.
    Critical study of Michael Potter, Reason's Nearest Kin. Philosophies of Arithmetic from Kant to Carnap. Oxford University Press, Oxford, 2000. x + 305 pages.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  32.  14
    Semantics and Proof Theory of the Epsilon Calculus.Richard Zach - 2017 - In Sujata Ghosh & Sanjiva Prasad (eds.), Logic and Its Applications. ICLA 2017. Berlin, Heidelberg: Springer. pp. 27-47.
    The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and accessible presentations of its theory on the other. One significant early result for the original axiomatic proof system for the epsilon-calculus is the first epsilon theorem, for which a proof is sketched. The system itself is discussed, also relative to possible semantic interpretations. The problems facing (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  33.  15
    Compact Propositional Gödel Logics.Matthias Baaz & Richard Zach - 1998 - In 28th IEEE International Symposium on Multiple-Valued Logic, 1998. Proceedings. Los Alamitos: IEEE Press. pp. 108-113.
    Entailment in propositional Gödel logics can be defined in a natural way. While all infinite sets of truth values yield the same sets of tautologies, the entailment relations differ. It is shown that there is a rich structure of infinite-valued Gödel logics, only one of which is compact. It is also shown that the compact infinite-valued Gödel logic is the only one which interpolates, and the only one with an r.e. entailment relation.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  34.  11
    Approximating Propositional Calculi by Finite-Valued Logics.Matthias Baaz & Richard Zach - 1994 - In 24th International Symposium on Multiple-valued Logic, 1994. Proceedings. Los Alamitos: IEEE Press. pp. 257–263.
    The problem of approximating a propositional calculus is to find many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few tautologies as possible. This has potential applications for representing (computationally complex) logics used in AI by (computationally easy) many-valued logics. It is investigated how far this method can be carried using (1) one or (2) an infinite sequence of many-valued logics. It is shown that the optimal candidate matrices for (1) can (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  35.  30
    George S. Boolos, John P. Burgess, and Richard C. Jeffrey. Computability and Logic, 4th Ed. Cambridge University Press, Cambridge, 2002. [REVIEW]Richard Zach - 2003 - Bulletin of Symbolic Logic 9 (4):520-521.
  36.  6
    Generalizing Theorems in Real Closed Fields.Matthias Baaz & Richard Zach - 1995 - Annals of Pure and Applied Logic 75 (1-2):3-23.
    Jan Krajíček posed the following problem: Is there is a generalization result in the theory of real closed fields of the form: If A is provable in length k for all n ϵ ω , then A is provable? It is argued that the answer to this question depends on the particular formulation of the “theory of real closed fields.” Four distinct formulations are investigated with respect to their generalization behavior. It is shown that there is a positive answer to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  37.  37
    Gödel’s First Incompleteness Theorem and Mathematical Instrumentalism.Richard Zach - manuscript
    Direct download  
     
    Export citation  
     
    Bookmark  
  38.  13
    2000-2001 Spring Meeting of the Association for Symbolic Logic.Michael Detlefsen, Erich Reck, Colin McLarty, Rohit Parikh, Larry Moss, Scott Weinstein, Gabriel Uzquiano, Grigori Mints & Richard Zach - 2001 - Bulletin of Symbolic Logic 7 (3):413-419.
  39.  11
    Leonard Bolc and Piotr Borowik: Many-Valued Logics: 1. Theoretical Foundations, Berlin: Springer, 1991. [REVIEW]Petr Hajek & Richard Zach - 1994 - Journal of Applied Non-Classical Logics 4 (2):215-220.
  40.  30
    Decidability of Quantified Propositional Intuitionistic Logic and S4 on Trees of Height and Arity ≤Ω.Richard Zach - 2004 - Journal of Philosophical Logic 33 (2):155-164.
    Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers ∀p, ∃p, where the propositional variables range over upward-closed subsets of the set of worlds in a Kripke structure. If the permitted accessibility relations are arbitrary partial orders, the resulting logic is known to be recursively isomorphic to full second-order logic (Kremer, 1997). It is shown that if the Kripke structures are restricted to trees of at height and width at most ω, the resulting logics are decidable. (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  41.  13
    Note on Generalizing Theorems in Algebraically Closed Fields.Matthias Baaz & Richard Zach - 1998 - Archive for Mathematical Logic 37 (5-6):297-307.
    The generalization properties of algebraically closed fields $ACF_p$ of characteristic $p > 0$ and $ACF_0$ of characteristic 0 are investigated in the sequent calculus with blocks of quantifiers. It is shown that $ACF_p$ admits finite term bases, and $ACF_0$ admits term bases with primality constraints. From these results the analogs of Kreisel's Conjecture for these theories follow: If for some $k$ , $A(1 + \cdots + 1)$ ( $n$ 1's) is provable in $k$ steps, then $(\forall x)A(x)$ is provable.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  42.  12
    Le quantificateur effini, la descente infinie et les preuves de consistance de Gauthier. [REVIEW]Richard Zach - 2004 - Philosophiques 31 (1):221-224.
    Internal Logic brings together several threads of Yvon Gauthier's work on the foundations of mathematics and revisits his attempt to, as he puts it, radicalize Hilbert's Program. A radicalization of Hilbert's Program, I take it, is supposed to take Hilberts' finitary viewpoint more seriously than other attempts to salvage Hilbert's Program have. Such a return to the "roots of Hilbert's metamathematical idea" will, so claims Gauthier, enable him to save Hilbert's Program.
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  43.  25
    Mathematical Methods in Philosophy: Editors' Introduction.Aldo Antonelli, Alasdair Urquhart & Richard Zach - 2008 - Review of Symbolic Logic 1 (2):143-145.
    Mathematics and philosophy have historically enjoyed a mutually beneficial and productive relationship, as a brief review of the work of mathematician–philosophers such as Descartes, Leibniz, Bolzano, Dedekind, Frege, Brouwer, Hilbert, Gödel, and Weyl easily confirms. In the last century, it was especially mathematical logic and research in the foundations of mathematics which, to a significant extent, have been driven by philosophical motivations and carried out by technically minded philosophers. Mathematical logic continues to play an important role in contemporary philosophy, and (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  44. Hilbert's Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45.  13
    Proof Theory of Finite-Valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien
    The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued first order (...)
    Direct download  
     
    Export citation  
     
    Bookmark