View topic on PhilPapers for more information
Related categories

25 found
Order:
More results on PhilPapers
  1. added 2020-02-05
    Traits essentiels d'une formalisation adéquate.Gheorghe-Ilie Farte - 2020 - Argumentum. Journal of the Seminar of Discursive Logic, Argumentation Theory and Rhetoric 18 (1):163-174.
    In order to decide whether a discursive product of human reason corresponds or not to the logical order, one must analyze it in terms of syntactic correctness, consistency, and validity. The first step in logical analysis is formalization, that is, the process by which logical forms of thoughts are represented in different formal languages or logical systems. Although each thought can be properly formalized in different ways, the formalization variants are not equally adequate. The adequacy of formalization seems to depend (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  2. added 2020-01-11
    The Accident of Logical Constants.Tristan Grøtvedt Haze - 2020 - Thought: A Journal of Philosophy 9 (1):34-42.
    Work on the nature and scope of formal logic has focused unduly on the distinction between logical and extra-logical vocabulary; which argument forms a logical theory countenances depends not only on its stock of logical terms, but also on its range of grammatical categories and modes of composition. Furthermore, there is a sense in which logical terms are unnecessary. Alexandra Zinke has recently pointed out that propositional logic can be done without logical terms. By defining a logical-term-free language with the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. added 2019-06-04
    The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.
    We consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary evidence-based definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways: (1) in terms of classical algorithmic verifiabilty; and (2) in terms of finitary algorithmic computability. We then show that the two definitions correspond to two distinctly different assignments of satisfaction and truth (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. added 2019-03-24
    Two-Sided Trees for Sentential Logic, Predicate Logic, and Sentential Modal Logic.Jesse Fitts & David Beisecker - 2019 - Teaching Philosophy 42 (1):41-56.
    This paper will present two contributions to teaching introductory logic. The first contribution is an alternative tree proof method that differs from the traditional one-sided tree method. The second contribution combines this tree system with an index system to produce a user-friendly tree method for sentential modal logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. added 2019-03-09
    An Arithmetization of Logical Oppositions.Fabien Schang - 2016 - In Jean-Yves Beziau & Gianfranco Basti (eds.), The Square of Opposition: A Cornerstone of Thought. Bâle, Suisse: pp. 215-237.
    An arithmetic theory of oppositions is devised by comparing expressions, Boolean bitstrings, and integers. This leads to a set of correspondences between three domains of investigation, namely: logic, geometry, and arithmetic. The structural properties of each area are investigated in turn, before justifying the procedure as a whole. Io finish, I show how this helps to improve the logical calculus of oppositions, through the consideration of corresponding operations between integers.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  6. added 2018-11-21
    On the Concept of a Notational Variant.Alexander W. Kocurek - 2017 - In Alexandru Baltag, Jeremy Seligman & Tomoyuki Yamada (eds.), Logic, Rationality, and Interaction (LORI 2017, Sapporo, Japan). pp. 284-298.
    In the study of modal and nonclassical logics, translations have frequently been employed as a way of measuring the inferential capabilities of a logic. It is sometimes claimed that two logics are “notational variants” if they are translationally equivalent. However, we will show that this cannot be quite right, since first-order logic and propositional logic are translationally equivalent. Others have claimed that for two logics to be notational variants, they must at least be compositionally intertranslatable. The definition of compositionality these (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. added 2018-08-06
    Categories of First-Order Quantifiers.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Basel, Switzerland: pp. 575-597.
    One well known problem regarding quantifiers, in particular the 1storder 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   2 citations  
  8. added 2018-06-29
    Gödel's Slingshot Revisited: Does Russell's Theory of Descriptions Really Evade the Slingshot.João Daniel Dantas - 2016 - Dissertation, UFRN
    “Slingshot Arguments” are a family of arguments underlying the Fregean view that if sentences have reference at all, their references are their truth-values. Usually seen as a kind of collapsing argument, the slingshot consists in proving that, once you suppose that there are some items that are references of sentences (as facts or situations, for example), these items collapse into just two items: The True and The False. This dissertation treats of the slingshot dubbed “Gödel’s slingshot”. Gödel argued that there (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. added 2018-04-20
    Classes and Theories of Trees Associated with a Class of Linear Orders.Valentin Goranko & Ruaan Kellerman - 2011 - Logic Journal of the IGPL 19 (1):217-232.
    Given a class of linear order types C, we identify and study several different classes of trees, naturally associated with C in terms of how the paths in those trees are related to the order types belonging to C. We investigate and completely determine the set-theoretic relationships between these classes of trees and between their corresponding first-order theories. We then obtain some general results about the axiomatization of the first-order theories of some of these classes of trees in terms of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  10. added 2017-10-14
    Rigid and Flexible Quantification in Plural Predicate Logic.Lucas Champollion, Justin Bledin & Haoze Li - forthcoming - Semantics and Linguistic Theory 27.
    Noun phrases with overt determiners, such as <i>some apples</i> or <i>a quantity of milk</i>, differ from bare noun phrases like <i>apples</i> or <i>milk</i> in their contribution to aspectual composition. While this has been attributed to syntactic or algebraic properties of these noun phrases, such accounts have explanatory shortcomings. We suggest instead that the relevant property that distinguishes between the two classes of noun phrases derives from two modes of existential quantification, one of which holds the values of a variable fixed (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. added 2017-05-20
    A Technique for Determing Closure in Semantic Tableaux.Steven James Bartlett - 1983 - Methodology and Science: Interdisciplinary Journal for the Empirical Study of the Foundations of Science and Their Methodology 16 (1):1-16.
    The author considers the model-theoretic character of proofs and disproofs by means of attempted counterexample constructions, distinguishes this proof format from formal derivations, then contrasts two approaches to semantic tableaux proposed by Beth and Lambert-van Fraassen. It is noted that Beth's original approach has not as yet been provided with a precisely formulated rule of closure for detecting tableau sequences terminating in contradiction. To remedy this deficiency, a technique is proposed to clarify tableau operations.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  12. added 2016-05-14
    The Benefits of Realism: A Realist Logic with Applications.Barry Smith - 2008 - In Katherine Munn & Barry Smith (eds.), Applied Ontology: An Introduction. Ontos. pp. 109-124.
    We propose a formalization of a realist ontology using first order logic with identity and allowing quantification over terms representing both individuals and universals. In addition to identity, the ontology includes also relational predicates such as subtype, instantiation, parthood, location, and inherence. Inspired in part by Davidson’s treatment of events, the ontology includes also various relations linking events to their participants and to the times at which they occur.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. added 2016-02-08
    1983 Review in Mathematical Reviews 83e:03005 Of: Cocchiarella, Nino “The Development of the Theory of Logical Types and the Notion of a Logical Subject in Russell's Early Philosophy: Bertrand Russell's Early Philosophy, Part I”. Synthese 45 (1980), No. 1, 71-115.John Corcoran - 1983 - MATHEMATICAL REVIEWS 83:03005.
    CORCORAN RECOMMENDS COCCHIARELLA ON TYPE THEORY. The 1983 review in Mathematical Reviews 83e:03005 of: Cocchiarella, Nino “The development of the theory of logical types and the notion of a logical subject in Russell's early philosophy: Bertrand Russell's early philosophy, Part I”. Synthese 45 (1980), no. 1, 71-115 .
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. added 2015-09-20
    Information Recovery Problems.John Corcoran - 1995 - Theoria 10 (3):55-78.
    An information recovery problem is the problem of constructing a proposition containing the information dropped in going from a given premise to a given conclusion that folIows. The proposition(s) to beconstructed can be required to satisfy other conditions as well, e.g. being independent of the conclusion, or being “informationally unconnected” with the conclusion, or some other condition dictated by the context. This paper discusses various types of such problems, it presents techniques and principles useful in solving them, and it develops (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  15. added 2015-06-05
    Complete Enumerative Inductions.John Corcoran - 2006 - Bulletin of Symbolic Logic 12:465-6.
    Consider the following. The first is a one-premise argument; the second has two premises. The question sign marks the conclusions as such. -/- Matthew, Mark, Luke, and John wrote Greek. ? Every evangelist wrote Greek. -/- Matthew, Mark, Luke, and John wrote Greek. Every evangelist is Matthew, Mark, Luke, or John. ? Every evangelist wrote Greek. -/- The above pair of premise-conclusion arguments is of a sort familiar to logicians and philosophers of science. In each case the first premise is (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. added 2015-05-26
    Commentary On: Jesse Bohl's "What Are We to Do About Traditional Logic?".Gilbert Plumer - 2000 - In Christopher W. Tindale, Hans V. Hansen & Elmar Sveda (eds.), Argumentation at the Century's Turn [CD-ROM]. Ontario Society for the Study of Argumentation. pp. 1-4.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17. added 2015-04-19
    “Truth-Preserving and Consequence-Preserving Deduction Rules”,.John Corcoran - 2014 - Bulletin of Symbolic Logic 20 (1):130-1.
    A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been criticized for (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. added 2015-01-12
    Aristotle's Many-Sorted Logic.J. Corcoran - 2008 - Bulletin of Symbolic Logic 14 (1):155-156.
    As noted in 1962 by Timothy Smiley, if Aristotle’s logic is faithfully translated into modern symbolic logic, the fit is exact. If categorical sentences are translated into many-sorted logic MSL according to Smiley’s method or the two other methods presented here, an argument with arbitrarily many premises is valid according to Aristotle’s system if and only if its translation is valid according to modern standard many-sorted logic. As William Parry observed in 1973, this result can be proved using my 1972 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  19. added 2013-07-03
    A Taste of Set Theory for Philosophers.Jouko Väänänen - 2011 - Journal of the Indian Council of Philosophical Research (2):143-163.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  20. added 2013-03-21
    The Power of Logic, 6th Edition.Daniel Howard-Snyder, Frances Howard-Snyder & Ryan Wasserman - 2020 - New York: McGraw-Hill.
    This is a basic logic text for first-time logic students. Custom-made texts from the chapters is an option as well. And there is a website to go with text too.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  21. added 2013-03-18
    The Cube, the Square and the Problem of Existential Import.Saloua Chatti & Fabien Schang - 2013 - History and Philosophy of Logic 34 (2):101-132.
    We re-examine the problem of existential import by using classical predicate logic. Our problem is: How to distribute the existential import among the quantified propositions in order for all the relations of the logical square to be valid? After defining existential import and scrutinizing the available solutions, we distinguish between three possible cases: explicit import, implicit non-import, explicit negative import and formalize the propositions accordingly. Then, we examine the 16 combinations between the 8 propositions having the first two kinds of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   9 citations  
  22. added 2013-03-05
    Forall X: An Introduction to Formal Logic.P. D. Magnus - 2005
    An introduction to sentential logic and first-order predicate logic with identity, logical systems that significantly influenced twentieth-century analytic philosophy. After working through the material in this book, a student should be able to understand most quantified expressions that arise in their philosophical reading. -/- This books treats symbolization, formal semantics, and proof theory for each language. The discussion of formal semantics is more direct than in many introductory texts. Although forall x does not contain proofs of soundness and completeness, it (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  23. added 2012-08-06
    First-Order Logic and Some Existential Sentences.Stephen K. McLeod - 2011 - Disputatio 4 (31):255-270.
    ‘Quantified pure existentials’ are sentences (e.g., ‘Some things do not exist’) which meet these conditions: (i) the verb EXIST is contained in, and is, apart from quantificational BE, the only full (as against auxiliary) verb in the sentence; (ii) no (other) logical predicate features in the sentence; (iii) no name or other sub-sentential referring expression features in the sentence; (iv) the sentence contains a quantifier that is not an occurrence of EXIST. Colin McGinn and Rod Girle have alleged that standard (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. added 2011-07-18
    A Speech Act Calculus. A Pragmatised Natural Deduction Calculus and its Meta-Theory.Moritz Cordes & Friedrich Reinmuth - manuscript
    Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e. a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs. (Translation of our German paper "Ein Redehandlungskalkül. Ein (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  25. added 2010-11-04
    Ein Redehandlungskalkül. Ein pragmatisierter Kalkül des natürlichen Schließens nebst Metatheorie.Moritz Cordes & Friedrich Reinmuth - manuscript
    Building on the work of Peter Hinst and Geo Siegwart, we develop a pragmatised natural deduction calculus, i.e., a natural deduction calculus that incorporates illocutionary operators at the formal level, and prove its adequacy. In contrast to other linear calculi of natural deduction, derivations in this calculus are sequences of object-language sentences which do not require graphical or other means of commentary in order to keep track of assumptions or to indicate subproofs.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation