Results for 'Zach Barnett'

61 found
Order:
  1. Rational Moral Ignorance.Zach Barnett - forthcoming - Philosophy and Phenomenological Research.
    What should a person do when, through no fault of her own, she ends up believing a false moral theory? Some suggest that she should act against what the false theory recommends; others argue that she should follow her rationally held moral beliefs. While the former view better accords with intuitions about cases, the latter one seems to enjoy a critical advantage: It seems better able to render moral requirements ‘followable’ or ‘action-guiding.’ But this tempting thought proves difficult to justify. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Philosophy Without Belief.Zach Barnett - 2019 - Mind 128 (509):109-138.
    Should we believe our controversial philosophical views? Recently, several authors have argued from broadly conciliationist premises that we should not. If they are right, we philosophers face a dilemma: If we believe our views, we are irrational. If we do not, we are not sincere in holding them. This paper offers a way out, proposing an attitude we can rationally take toward our views that can support sincerity of the appropriate sort. We should arrive at our views via a certain (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  3. No Free Lunch: The Significance of Tiny Contributions.Zach Barnett - 2018 - Analysis 78 (1):3-13.
    There is a well-known moral quandary concerning how to account for the rightness or wrongness of acts that clearly contribute to some morally significant outcome – but which each seem too small, individually, to make any meaningful difference. One consequentialist-friendly response to this problem is to deny that there could ever be a case of this type. This paper pursues this general strategy, but in an unusual way. Existing arguments for the consequentialist-friendly position are sorites-style arguments. Such arguments imagine varying (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  4. Belief Dependence: How Do the Numbers Count?Zach Barnett - 2019 - Philosophical Studies 176 (2):297-319.
    This paper is about how to aggregate outside opinion. If two experts are on one side of an issue, while three experts are on the other side, what should a non-expert believe? Certainly, the non-expert should take into account more than just the numbers. But which other factors are relevant, and why? According to the view developed here, one important factor is whether the experts should have been expected, in advance, to reach the same conclusion. When the agreement of two (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  5. Tolerance and the Distributed Sorites.Zach Barnett - 2019 - Synthese 196 (3):1071-1077.
    On some accounts of vagueness, predicates like “is a heap” are tolerant. That is, their correct application tolerates sufficiently small changes in the objects to which they are applied. Of course, such views face the sorites paradox, and various solutions have been proposed. One proposed solution involves banning repeated appeals to tolerance, while affirming tolerance in any individual case. In effect, this solution rejects the reasoning of the sorites argument. This paper discusses a thorny problem afflicting this approach to vagueness. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Conciliationism and Merely Possible Disagreement.Zach Barnett & Han Li - 2016 - Synthese 193 (9):1-13.
    Conciliationism faces a challenge that has not been satisfactorily addressed. There are clear cases of epistemically significant merely possible disagreement, but there are also clear cases where merely possible disagreement is epistemically irrelevant. Conciliationists have not yet accounted for this asymmetry. In this paper, we propose that the asymmetry can be explained by positing a selection constraint on all cases of peer disagreement—whether actual or merely possible. If a peer’s opinion was not selected in accordance with the proposed constraint, then (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  7. Fool Me Once: Can Indifference Vindicate Induction?Zach Barnett & Han Li - 2018 - Episteme 15 (2):202-208.
    Roger White (2015) sketches an ingenious new solution to the problem of induction. He argues from the principle of indifference for the conclusion that the world is more likely to be induction- friendly than induction-unfriendly. But there is reason to be skeptical about the proposed indifference-based vindication of induction. It can be shown that, in the crucial test cases White concentrates on, the assumption of indifference renders induction no more accurate than random guessing. After discussing this result, the paper explains (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Using Computer-Assisted Argument Mapping to Teach Reasoning to Students.Martin Davies, Ashley Barnett & Tim van Gelder - 2019 - In J. Anthony Blair (ed.), Studies in Critical Thinking. Windsor, ON, Canada: Windsor Studies in Argumentation. pp. 131-176.
    Argument mapping is a way of diagramming the logical structure of an argument to explicitly and concisely represent reasoning. The use of argument mapping in critical thinking instruction has increased dramatically in recent decades. This paper overviews the innovation and provides a procedural approach for new teaches wanting to use argument mapping in the classroom. A brief history of argument mapping is provided at the end of this paper.
    Download  
     
    Export citation  
     
    Bookmark  
  9. 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.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  10. Is Memory Merely Testimony From One's Former Self?David James Barnett - 2015 - Philosophical Review 124 (3):353-392.
    A natural view of testimony holds that a source's statements provide one with evidence about what the source believes, which in turn provides one with evidence about what is true. But some theorists have gone further and developed a broadly analogous view of memory. According to this view, which this essay calls the “diary model,” one's memory ordinarily serves as a means for one's present self to gain evidence about one's past judgments, and in turn about the truth. This essay (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  11.  80
    Higher-Order Defeat in Realist Moral Epistemology.Brian C. Barnett - 2020 - In Michael Klenk (ed.), Higher Order Evidence and Moral Epistemology. New York: pp. 117-135.
    On an optimistic version of realist moral epistemology, a significant range of ordinary moral beliefs, construed in realist terms, constitute knowledge—or at least some weaker positive epistemic status, such as epistemic justification. The “debunking challenge” to this view grants prima facie justification but claims that it is “debunked” (i.e., defeated), yielding the final verdict that moral beliefs are ultima facie unjustified. Notable candidate “debunkers” (i.e., defeaters) include the so-called “evolutionary debunking arguments,” the “Benacerraf-Field Challenge,” and persistent moral disagreement among epistemic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  13. What’s the Matter with Epistemic Circularity?David James Barnett - 2014 - Philosophical Studies 171 (2):177-205.
    If the reliability of a source of testimony is open to question, it seems epistemically illegitimate to verify the source’s reliability by appealing to that source’s own testimony. Is this because it is illegitimate to trust a questionable source’s testimony on any matter whatsoever? Or is there a distinctive problem with appealing to the source’s testimony on the matter of that source’s own reliability? After distinguishing between two kinds of epistemically illegitimate circularity—bootstrapping and self-verification—I argue for a qualified version of (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  14. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  15. Forall X: Calgary. An Introduction to Formal Logic.P. D. Magnus, Tim Button, Aaron Thomas-Bolduc, Richard Zach & Robert Trueman - 2019
    forall x: Calgary is a full-featured textbook on formal logic. It covers key notions of logic such as consequence and validity of arguments, the syntax of truth-functional propositional logic TFL and truth-table semantics, the syntax of first-order (predicate) logic FOL with identity (first-order interpretations), translating (formalizing) English in TFL and FOL, and Fitch-style natural deduction proof systems for both TFL and FOL. It also deals with some advanced topics such as truth-functional completeness and modal logic. Exercises with solutions are available. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. 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.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  68
    Introduction.Martin Davies & Ronald Barnett - 2015 - In M. Davies and R. Barnett (ed.), The Palgrave Handbook of Critical Thinking in Higher Education. New York, NY, USA: pp. 1-25.
    What is critical thinking, especially in the context of higher education? How have research and scholarship on the matter developed over recent past decades? What is the current state of the art here? How might the potential of critical thinking be enhanced? What kinds of teaching are necessary in order to realize that potential? And just why is this topic important now? These are the key questions motivating this volume. We hesitate to use terms such as “comprehensive” or “complete” or (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  18. Torkel Franzén, Gödel's Theorem: An Incomplete Guide to its Use and Abuse. [REVIEW]R. Zach - 2005 - History and Philosophy of Logic 26 (4):369-371.
    On the heels of Franzén's fine technical exposition of Gödel's incompleteness theorems and related topics (Franzén 2004) comes this survey of the incompleteness theorems aimed at a general audience. Gödel's Theorem: An Incomplete Guide to its Use and Abuse is an extended and self-contained exposition of the incompleteness theorems and a discussion of what informal consequences can, and in particular cannot, be drawn from them.
    Download  
     
    Export citation  
     
    Bookmark  
  19. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  20. Perceptual Justification and the Cartesian Theater.David James Barnett - 2019 - Oxford Studies in Epistemology 6.
    According to a traditional Cartesian epistemology of perception, perception does not provide one with direct knowledge of the external world. Instead, your immediate perceptual evidence is limited to facts about your own visual experience, from which conclusions about the external world must be inferred. Cartesianism faces well-known skeptical challenges. But this chapter argues that any anti-Cartesian view strong enough to avoid these challenges must license a way of updating one’s beliefs in response to anticipated experiences that seems diachronically irrational. To (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  21. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  22.  57
    Evaluation of a Student-Oriented Logic Course.Aaron Thomas-Bolduc & Richard Zach - 2018 - ISSOTL 2018 Annual Meeting.
    In Winter 2017, the first author piloted a course in formal logic in which we aimed to (a) improve student engagement and mastery of the content, and (b) reduce maths anxiety and its negative effects on student outcomes, by adopting student oriented teaching including peer instruction and classroom flipping techniques. The course implemented a partially flipped approach, and incorporated group-work and peer learning elements, while retaining some of the traditional lecture format. By doing this, a wide variety of student learning (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. A Probabilistic Defense of Proper De Jure Objections to Theism.Brian C. Barnett - manuscript
    A common view among nontheists combines the de jure objection that theism is epistemically unacceptable with agnosticism about the de facto objection that theism is false. Following Plantinga, we can call this a “proper” de jure objection—a de jure objection that does not depend on any de facto objection. In his Warranted Christian Belief, Plantinga has produced a general argument against all proper de jure objections. Here I first show that this argument is logically fallacious (it makes subtle probabilistic fallacies (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  25. 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.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  26. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  27. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  28. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  30.  78
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  31. 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.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  32. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  33. 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.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  34. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35.  91
    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.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  36.  49
    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.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  37. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. 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 .
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  39. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41.  96
    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.
    Download  
     
    Export citation  
     
    Bookmark  
  42.  47
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  43.  61
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  44. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Wisdom in the University.Nicholas Maxwell & Ronald Barnett - 2008 - Routledge.
    We face grave global problems. We urgently need to learn how to tackle them in wiser, more effective, intelligent and humane ways than we have done so far. This requires that universities become devoted to helping humanity acquire the necessary wisdom to perform the task. But at present universities do not even conceive of their role in these terms. The essays of this book consider what needs to change in the university if it is to help humanity acquire the wisdom (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  46. Computability. Computable Functions, Logic, and the Foundations of Mathematics. [REVIEW]R. Zach - 2002 - History and Philosophy of Logic 23 (1):67-69.
    Epstein and Carnielli's fine textbook on logic and computability is now in its second edition. The readers of this journal might be particularly interested in the timeline `Computability and Undecidability' added in this edition, and the included wall-poster of the same title. The text itself, however, has some aspects which are worth commenting on.
    Download  
     
    Export citation  
     
    Bookmark  
  47. Hilbert's Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  48.  41
    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.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  49. What Decision Theory Provides the Best Procedure for Identifying the Best Action Available to a Given Artificially Intelligent System?Samuel A. Barnett - 2018 - Dissertation, University of Oxford
    Decision theory has had a long-standing history in the behavioural and social sciences as a tool for constructing good approximations of human behaviour. Yet as artificially intelligent systems (AIs) grow in intellectual capacity and eventually outpace humans, decision theory becomes evermore important as a model of AI behaviour. What sort of decision procedure might an AI employ? In this work, I propose that policy-based causal decision theory (PCDT), which places a primacy on the decision-relevance of predictors and simulations of agent (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. Boxes and Diamonds. An Open Introduction to Modal Logic.Richard Zach - 2019
    A textbook for modal and other intensional logics based on the Open Logic Project. It covers normal modal logics, relational semantics, axiomatic and tableaux proof systems, intuitionistic logic, and counterfactual conditionals.
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 61