View topic on PhilPapers for more information
Related categories

54 found
Order:
More results on PhilPapers
1 — 50 / 54
  1. added 2019-04-20
    The Origin of Europe and the Esprit de Geometrie.Francesco Tampoia - manuscript
    In searching for the origin of Europe and the cultural region/continent that we call “Europe”, at first glance we have to consider at least a double view: on the one hand the geographical understanding which indicates a region or a continent. On the other a certain form of identity and culture described and defined as European. Rodolphe Gasché taking hint from Husserl’s passage ‘Europe is not to be construed simply as a geographical and political entity’ states that a rigorous engagement (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. added 2019-04-04
    Incompleteness and Computability.Richard Zach - 2018 - CreateSpace.
    Covers recursive function theory, Gödel’s incompleteness theorem, models of arithmetic, and second-order logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. added 2019-04-04
    Sets, Logic, Computation.Richard Zach - 2017 - CreateSpace.
    Covers naive set theory, first-order logic, sequent calculus and natural deduction, the completeness, compactness, and Löwenheim-Skolem theorems, Turing machines, and the undecidability of the halting problem and of first-order logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. added 2019-04-02
    Categories of First -Order Quantifiers.Urszula Wybraniec-Skardowska - 2018 - Lvov-Warsaw School. Past and Present.
    One well known problem regarding quantifiers, in particular the 1st order quantifiers, is connected with their syntactic categories and denotations.The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for categorial languages generated (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. added 2019-04-02
    Teoria zdań odrzuconych.Urszula Wybraniec-Skardowska - 1969 - Dissertation, Opole University
    This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  6. added 2019-03-24
    The Lvov-Warsaw School. Past and Present.Urszula Wybraniec-Skardowska & Ángel Garrido (eds.) - 2018 - Cham, Switzerland: Springer- Birkhauser,.
    This is a collection of new investigations and discoveries on the history of a great tradition, the Lvov-Warsaw School of logic , philosophy and mathematics, by the best specialists from all over the world. The papers range from historical considerations to new philosophical, logical and mathematical developments of this impressive School, including applications to Computer Science, Mathematics, Metalogic, Scientific and Analytic Philosophy, Theory of Models and Linguistics.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. added 2019-03-15
    Combining Algebraizable Logics.A. Jánossy, Á Kurucz & Á. E. Eiben - 1996 - Notre Dame Journal of Formal Logic 37 (2):366-380.
    The general methodology of "algebraizing" logics is used here for combining different logics. The combination of logics is represented as taking the colimit of the constituent logics in the category of algebraizable logics. The cocompleteness of this category as well as its isomorphism to the corresponding category of certain first-order theories are proved.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  8. added 2018-09-13
    Complexity of Judgment Aggregation.Ulle Endriss, Umberto Grandi & Daniele Porello - 2012 - Journal of Artificial Intelligence Research 45:481--514.
    We analyse the computational complexity of three problems in judgment aggregation: (1) computing a collective judgment from a profile of individual judgments (the winner determination problem); (2) deciding whether a given agent can influence the outcome of a judgment aggregation procedure in her favour by reporting insincere judgments (the strategic manipulation problem); and (3) deciding whether a given judgment aggregation scenario is guaranteed to result in a logically consistent outcome, independently from what the judgments supplied by the individuals are (the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  9. added 2018-08-06
    Rejection in Łukasiewicz's and Słupecki's Sense.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Basel, Switzerland: pp. 575-597.
    The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. added 2018-07-11
    Computational Reverse Mathematics and Foundational Analysis.Benedict Eastaugh - manuscript
    Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. added 2018-05-11
    What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic, part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. added 2018-05-01
    Willard Van Orman Quine's Philosophical Development in the 1930s and 1940s.Frederique Janssen-Lauret - 2018 - In Walter Carnielli, Frederique Janssen-Lauret & William Pickering (eds.), The Significance of the New Logic. Cambridge: Cambridge University Press.
    As analytic philosophy is becoming increasingly aware of and interested in its own history, the study of that field is broadening to include, not just its earliest beginnings, but also the mid-twentieth century. One of the towering figures of this epoch is W.V. Quine (1908-2000), champion of naturalism in philosophy of science, pioneer of mathematical logic, trying to unite an austerely physicalist theory of the world with the truths of mathematics, psychology, and linguistics. Quine's posthumous papers, notes, and drafts revealing (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. added 2018-04-18
    Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic.Luis M. Augusto - 2018 - London: College Publications.
    This is the first of a two-volume work combining two fundamental components of contemporary computing into classical deductive computing, a powerful form of computation, highly adequate for programming and automated theorem proving, which, in turn, have fundamental applications in areas of high complexity and/or high security such as mathematical proof, software specification and verification, and expert systems. Deductive computation is concerned with truth-preservation: This is the essence of the satisfiability problem, or SAT, the central computational problem in computability and complexity (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. added 2018-03-22
    Logic and Sense.Urszula Wybraniec-Skardowska - 2016 - Philosophy Study 6 (9).
    In the paper, original formal-logical conception of syntactic and semantic: intensional and extensional senses of expressions of any language L is outlined. Syntax and bi-level intensional and extensional semantics of language L are characterized categorically: in the spirit of some Husserl’s ideas of pure grammar, Leśniewski-Ajukiewicz’s theory syntactic/semantic categories and in accordance with Frege’s ontological canons, Bocheński’s famous motto—syntax mirrors ontology and some ideas of Suszko: language should be a linguistic scheme of ontological reality and simultaneously a tool of its (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. added 2018-03-15
    Set Existence Principles and Closure Conditions: Unravelling the Standard View of Reverse Mathematics.Benedict Eastaugh - forthcoming - Philosophia Mathematica.
    It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the powerset of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. added 2018-03-05
    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.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  17. added 2018-01-18
    Temporal Justification Logic.S. Bucheli, M. Ghari & T. Studer - 2017 - Proceedings of the Ninth Workshop on Methods for Modalities (M4M9 2017), Indian Institute of Technology, Kanpur, India, 8th to 10th January 2017, Electronic Proceedings in Theoretical Computer Science 243, Pages 59–74.
    Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit counterparts to modal logics. The behavior and interaction of agents in distributed system is often modeled using logics of knowledge and time. In this paper, we sketch some preliminary ideas on how the modal knowledge part of such logics of knowledge and time could be replaced with an appropriate justification logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. added 2018-01-02
    Natural Deduction for Diagonal Operators.Fabio Lampert - 2017 - In Maria Zack & Dirk Schlimm (eds.), Research in History and Philosophy of Mathematics: The CSHPM 2016 Annual Meeting in Calgary, Alberta. Cham: Birkhäuser. pp. 39-51.
    We present a sound and complete Fitch-style natural deduction system for an S5 modal logic containing an actuality operator, a diagonal necessity operator, and a diagonal possibility operator. The logic is two-dimensional, where we evaluate sentences with respect to both an actual world (first dimension) and a world of evaluation (second dimension). The diagonal necessity operator behaves as a quantifier over every point on the diagonal between actual worlds and worlds of evaluation, while the diagonal possibility quantifies over some point (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  19. added 2017-11-26
    From Logical Calculus to Logical Formality—What Kant Did with Euler’s Circles.Huaping Lu-Adler - 2017 - In Corey W. Dyck & Falk Wunderlich (eds.), Kant and His German Contemporaries : Volume 1, Logic, Mind, Epistemology, Science and Ethics. Cambridge: Cambridge University Press. pp. 35-55.
    John Venn has the “uneasy suspicion” that the stagnation in mathematical logic between J. H. Lambert and George Boole was due to Kant’s “disastrous effect on logical method,” namely the “strictest preservation [of logic] from mathematical encroachment.” Kant’s actual position is more nuanced, however. In this chapter, I tease out the nuances by examining his use of Leonhard Euler’s circles and comparing it with Euler’s own use. I do so in light of the developments in logical calculus from G. W. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  20. added 2017-10-21
    Frege's Begriffsschrift is Indeed First-Order Complete.Yang Liu - 2017 - History and Philosophy of Logic 38 (4):342-344.
    It is widely taken that the first-order part of Frege's Begriffsschrift is complete. However, there does not seem to have been a formal verification of this received claim. The general concern is that Frege's system is one axiom short in the first-order predicate calculus comparing to, by now, the standard first-order theory. Yet Frege has one extra inference rule in his system. Then the question is whether Frege's first-order calculus is still deductively sufficient as far as the first-order completeness is (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  21. added 2017-10-10
    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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  22. added 2017-10-10
    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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  23. added 2017-10-10
    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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  24. added 2017-05-31
    Many-Valued Logics. A Mathematical and Computational Introduction.Luis M. Augusto - 2017 - London: College Publications.
    Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and they are (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  25. added 2017-05-01
    Mathematical Thinking Undefended on The Level of The Semester for Professional Mathematics Teacher Candidates. Toheri & Widodo Winarso - 2017 - Munich University Library.
    Mathematical thinking skills are very important in mathematics, both to learn math or as learning goals. Thinking skills can be seen from the description given answers in solving mathematical problems faced. Mathematical thinking skills can be seen from the types, levels, and process. Proportionally questions given to students at universities in Indonesia (semester I, III, V, and VII). These questions are a matter of description that belong to the higher-level thinking. Students choose 5 of 8 given problem. Qualitatively, the answers (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  26. added 2017-02-26
    Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.
    The present volume is an introduction to the use of tools from computability theory and reverse mathematics to study combinatorial principles, in particular Ramsey's theorem and special cases such as Ramsey's theorem for pairs. It would serve as an excellent textbook for graduate students who have completed a course on computability theory.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  27. added 2017-02-17
    La Logique Symbolique En Débat À Oxford À la Fin du XIXe Siècle : Les Disputes Logiques de Lewis Carroll Et John Cook Wilson.Mathieu Marion & Amirouche Moktefi - 2014 - Revue D’Histoire des Sciences 67 (2):185-205.
    The development of symbolic logic is often presented in terms of a cumulative story of consecutive innovations that led to what is known as modern logic. This narrative hides the difficulties that this new logic faced at first, which shaped its history. Indeed, negative reactions to the emergence of the new logic in the second half of the nineteenth century were numerous and we study here one case, namely logic at Oxford, where one finds Lewis Carroll, a mathematical teacher who (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  28. added 2017-01-27
    Logic in the Tractatus.Max Weiss - 2017 - Review of Symbolic Logic 10 (1):1-50.
    I present a reconstruction of the logical system of the Tractatus, which differs from classical logic in two ways. It includes an account of Wittgenstein’s “form-series” device, which suffices to express some effectively generated countably infinite disjunctions. And its attendant notion of structure is relativized to the fixed underlying universe of what is named. -/- There follow three results. First, the class of concepts definable in the system is closed under finitary induction. Second, if the universe of objects is countably (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. added 2017-01-12
    Logical Consequences. Theory and Applications: An Introduction.Luis M. Augusto - 2017 - London: College Publications.
    The theory of logical consequence is central in modern logic and its applications. However, it is mostly dispersed in an abundance of often difficultly accessible papers, and rarely treated with applications in mind. This book collects the most fundamental aspects of this theory and offers the reader the basics of its applications in computer science, artificial intelligence, and cognitive science, to name but the most important fields where this notion finds its many applications.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  30. added 2016-12-25
    Epistemology of Logic - Logic-Dialectic or Theory of the Knowledge.Epameinondas Xenopoulos - 1998 - Dissertation,
    1994.Επιστημολογία της Λογικής. Συγγραφέας Επαμεινώνδας Ξενόπουλος Μοναδική μελέτη και προσέγγιση της θεωρίας της γνώσης, για την παγκόσμια βιβλιογραφία, της διαλεκτικής πορείας της σκέψης από την λογική πλευρά της και της μελλοντικής μορφής που θα πάρουν οι διαλεκτικές δομές της, στην αδιαίρετη ενότητα γνωσιοθεωρίας, λογικής και διαλεκτικής, με την «μέθοδο του διαλεκτικού υλισμού». Έργο βαρύ με θέμα εξαιρετικά δύσκολο διακατέχεται από πρωτοτυπία και ζωντάνια που γοητεύει τον κάθε ανήσυχο στοχαστή από τις πρώτες γραμμές.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  31. added 2016-09-21
    Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program in the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  32. added 2016-08-26
    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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   5 citations  
  33. added 2016-05-19
    INVENTING LOGIC: THE LÖWENHEIM-SKOLEM THEOREM AND FIRST- AND SECOND-ORDER LOGIC.Valérie Lynn Therrien - 2012 - Pensées Canadiennes 10.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  34. added 2016-02-13
    Review of Hintikka and Remes. The Method of Analysis (Reidel, 1974).John Corcoran - 1979 - MATHEMATICAL REVIEWS 58:3202-3.
    John Corcoran. 1979 Review of Hintikka and Remes. The Method of Analysis (Reidel, 1974). Mathematical Reviews 58 3202 #21388. -/- The “method of analysis” is a technique used by ancient Greek mathematicians (and perhaps by Descartes, Newton, and others) in connection with discovery of proofs of difficult theorems and in connection with discovery of constructions of elusive geometric figures. Although this method was originally applied in geometry, its later application to number played an important role in the early development of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  35. added 2016-02-06
    Non-Deterministic Algebras and Algebraization of Logics.Ana Claudia Golzio & Marcelo E. Coniglio - 2015 - Filosofia da Linguagem E da Lógica (Philosophy of Language and Philosophy of Logic, in Portuguese).
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  36. added 2015-12-14
    Identity Logics.John Corcoran & Stanley Ziewacz - 1979 - Notre Dame Journal of Formal Logic 20 (4):777-784.
    In this paper we prove the completeness of three logical systems I LI, IL2 and IL3. IL1 deals solely with identities {a = b), and its deductions are the direct deductions constructed with the three traditional rules: (T) from a = b and b = c infer a = c, (S) from a = b infer b = a and (A) infer a = a(from anything). IL2 deals solely with identities and inidentities {a ± b) and its deductions include both (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  37. added 2015-09-08
    On Dummett’s Verificationist Justification Procedure.Wagner de Campos Sanz & Hermógenes Oliveira - 2016 - Synthese 193 (8):2539-2559.
    We examine the proof-theoretic verificationist justification procedure proposed by Dummett. After some scrutiny, two distinct interpretations with respect to bases are advanced: the independent and the dependent interpretation. We argue that both are unacceptable as a semantics for propositional intuitionistic logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  38. added 2015-08-26
    Expanding the Universe of Universal Logic.James Trafford - 2014 - Theoria: Revista de Teoría, Historia y Fundamentos de la Ciencia 29 (3):325-343.
    In [5], Béziau provides a means by which Gentzen’s sequent calculus can be combined with the general semantic theory of bivaluations. In doing so, according to Béziau, it is possible to construe the abstract “core” of logics in general, where logical syntax and semantics are “two sides of the same coin”. The central suggestion there is that, by way of a modification of the notion of maximal consistency, it is possible to prove the soundness and completeness for any normal logic. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  39. added 2015-05-22
    Raval’s Method a Simplified Approach to Propositional Logic Arguments.Ravinder Kumar Singh - manuscript
    Basic Argument forms Modus Ponens , Modus Tollens , Hypothetical Syllogism and Dilemma contains ‘If –then’ conditions. Conclusions from the Arguments containing ‘If –then’ conditions can be deduced very easily without any significant memorization by applying Raval’s method. Method: In Raval’s method If P then Q is written as P (2$) – Q (1$) and viewed numerically, in currency form i.e. P is viewed as 2$ and Q is viewed as 1$ and implications from this notations are valid conclusions. If (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  40. added 2015-02-09
    Counterexamples and Proexamples.J. Corcoran - 2005 - Bulletin of Symbolic Logic 11:460.
    Corcoran, J. 2005. Counterexamples and proexamples. Bulletin of Symbolic Logic 11(2005) 460. -/- John Corcoran, Counterexamples and Proexamples. Philosophy, University at Buffalo, Buffalo, NY 14260-4150 E-mail: corcoran@buffalo.edu Every perfect number that is not even is a counterexample for the universal proposition that every perfect number is even. Conversely, every counterexample for the proposition “every perfect number is even” is a perfect number that is not even. Every perfect number that is odd is a proexample for the existential proposition that some (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  41. added 2015-02-07
    A BIBLIOGRAPHY: JOHN CORCORAN's PUBLICATIONS ON ARISTOTLE 1972–2015.John Corcoran - manuscript
    This presentation includes a complete bibliography of John Corcoran’s publications devoted at least in part to Aristotle’s logic. Sections I–IV list 20 articles, 43 abstracts, 3 books, and 10 reviews. It starts with two watershed articles published in 1972: the Philosophy & Phenomenological Research article that antedates Corcoran’s Aristotle’s studies and the Journal of Symbolic Logic article first reporting his original results; it ends with works published in 2015. A few of the items are annotated with endnotes connecting them with (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  42. added 2015-01-12
    Review: The Contemporary Relevance of Ancient Logical Theory. [REVIEW]John Corcoran & Michael Scanlan - 1982 - Philosophical Quarterly 32 (126):76 - 86.
    This interesting and imaginative monograph is based on the author’s PhD dissertation supervised by Saul Kripke. It is dedicated to Timothy Smiley, whose interpretation of PRIOR ANALYTICS informs its approach. As suggested by its title, this short work demonstrates conclusively that Aristotle’s syllogistic is a suitable vehicle for fruitful discussion of contemporary issues in logical theory. Aristotle’s syllogistic is represented by Corcoran’s 1972 reconstruction. The review studies Lear’s treatment of Aristotle’s logic, his appreciation of the Corcoran-Smiley paradigm, and his understanding (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  43. added 2015-01-11
    Categoricity.John Corcoran - 1980 - History and Philosophy of Logic 1 (1):187-207.
    After a short preface, the first of the three sections of this paper is devoted to historical and philosophic aspects of categoricity. The second section is a self-contained exposition, including detailed definitions, of a proof that every mathematical system whose domain is the closure of its set of distinguished individuals under its distinguished functions is categorically characterized by its induction principle together with its true atoms (atomic sentences and negations of atomic sentences). The third section deals with applications especially those (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   20 citations  
  44. added 2014-11-07
    A Mathematical Model of Aristotle’s Syllogistic.John Corcoran - 1973 - Archiv für Geschichte der Philosophie 55 (2):191-219.
    In the present article we attempt to show that Aristotle's syllogistic is an underlying logiC which includes a natural deductive system and that it isn't an axiomatic theory as had previously been thought. We construct a mathematical model which reflects certain structural aspects of Aristotle's logic. We examine the relation of the model to the system of logic envisaged in scattered parts of Prior and Posterior Analytics. Our interpretation restores Aristotle's reputation as a logician of consummate imagination and skill. Several (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   9 citations  
  45. added 2014-10-16
    Partitions and Objective Indefiniteness.David Ellerman - manuscript
    Classical physics and quantum physics suggest two meta-physical types of reality: the classical notion of a objectively definite reality with properties "all the way down," and the quantum notion of an objectively indefinite type of reality. The problem of interpreting quantum mechanics (QM) is essentially the problem of making sense out of an objectively indefinite reality. These two types of reality can be respectively associated with the two mathematical concepts of subsets and quotient sets (or partitions) which are category-theoretically dual (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  46. added 2014-10-16
    An Introduction to Partition Logic.David Ellerman - 2014 - Logic Journal of the IGPL 22 (1):94-125.
    Classical logic is usually interpreted as the logic of propositions. But from Boole's original development up to modern categorical logic, there has always been the alternative interpretation of classical logic as the logic of subsets of any given (nonempty) universe set. Partitions on a universe set are dual to subsets of a universe set in the sense of the reverse-the-arrows category-theoretic duality--which is reflected in the duality between quotient objects and subobjects throughout algebra. Hence the idea arises of a dual (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  47. added 2014-03-30
    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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   9 citations  
  48. added 2014-01-12
    Guessing, Mind-Changing, and the Second Ambiguous Class.Samuel Alexander - 2016 - Notre Dame Journal of Formal Logic 57 (2):209-220.
    In his dissertation, Wadge defined a notion of guessability on subsets of the Baire space and gave two characterizations of guessable sets. A set is guessable if and only if it is in the second ambiguous class, if and only if it is eventually annihilated by a certain remainder. We simplify this remainder and give a new proof of the latter equivalence. We then introduce a notion of guessing with an ordinal limit on how often one can change one’s mind. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  49. added 2013-10-04
    Yablo Sequences in Truth Theories.Cezary Cieśliński - 2013 - In K. Lodaya (ed.), Logic and Its Applications, Lecture Notes in Computer Science LNCS 7750. Springer. pp. 127--138.
    We investigate the properties of Yablo sentences and for- mulas in theories of truth. Questions concerning provability of Yablo sentences in various truth systems, their provable equivalence, and their equivalence to the statements of their own untruth are discussed and answered.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  50. added 2013-08-08
    Symbolic Logic Study Guide (a Textbook).Xinli Wang - 2009 - University Readers.
    The Symbolic Logic Study Guide is designed to accompany the widely used symbolic logic textbook Language, Proof and Logic (LPL), by Jon Barwise and John Etchemendy (CSLI Publications 2003). The guide has two parts. The first part contains condensed, essential lecture notes, which streamline and systematize the first fourteen chapters of the book into seven teaching sections, and thus provide a clear, well-designed roadmap for the understanding of the text. The second part consists of twelve sample quizzes and solutions. The (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 54