Results for 'first-order definability'

1000+ found
Order:
  1. First-Order Swap Structures Semantics for Some Logics of Formal Inconsistency.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana Claudia Golzio - 2020 - Journal of Logic and Computation 30 (6):1257-1290.
    The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  2. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  3. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  4. Three Dogmas of First-Order Logic and Some Evidence-Based Consequences for Constructive Mathematics of Differentiating Between Hilbertian Theism, Brouwerian Atheism and Finitary Agnosticism.Bhupinder Singh Anand - manuscript
    We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what may (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5.  47
    What is Logical in First-Order Logic?Boris Čulina - manuscript
    In this article, logical concepts are defined using the internal syntactic and semantic structure of language. For a first-order language, it has been shown that its logical constants are connectives and a certain type of quantifiers for which the universal and existential quantifiers form a functionally complete set of quantifiers. Neither equality nor cardinal quantifiers belong to the logical constants of a first-order language.
    Download  
     
    Export citation  
     
    Bookmark  
  6. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. I—Columnar Higher-Order Vagueness, or Vagueness is Higher-Order Vagueness.Susanne Bobzien - 2015 - Aristotelian Society Supplementary Volume 89 (1):61-87.
    Most descriptions of higher-order vagueness in terms of traditional modal logic generate so-called higher-order vagueness paradoxes. The one that doesn't is problematic otherwise. Consequently, the present trend is toward more complex, non-standard theories. However, there is no need for this.In this paper I introduce a theory of higher-order vagueness that is paradox-free and can be expressed in the first-order extension of a normal modal system that is complete with respect to single-domain Kripke-frame semantics. This is (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  8. A Structural Approach to Defining Units of Selection.Elisabeth A. Lloyd - 1989 - Philosophy of Science 56 (3):395-418.
    The conflation of two fundamentally distinct issues has generated serious confusion in the philosophical and biological literature concerning the units of selection. The question of how a unit of selection of defined, theoretically, is rarely distinguished from the question of how to determine the empirical accuracy of claims--either specific or general--concerning which unit(s) is undergoing selection processes. In this paper, I begin by refining a definition of the unit of selection, first presented in the philosophical literature by William Wimsatt, (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  9. Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 2002 - In Frank Wolter, Heinrich Wansing, Maarten de Rijke & Michael Zakharyaschev (eds.), Advances in Modal Logic, Volume 3. World Scientific. pp. 221-240.
    We propose a generalization of Sahlqvist formulae to polyadic modal languages by representing modal polyadic languages in a combinatorial style and thus, in particular, developing what we believe to be the right approach to Sahlqvist formulae at all. The class of polyadic Sahlqvist formulae PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  10.  91
    Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 2002 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 221-240.
    We propose a generalization of Sahlqvist formulas to polyadic modal languages by representing such languages in a combinatorial PDL style and thus, in particular, developing what we believe to be the right syntactic approach to Sahlqvist formulas at all. The class of polyadic Sahlqvist formulas PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  11. If It's Clear, Then It's Clear That It's Clear, or is It? Higher-Order Vagueness and the S4 Axiom.Susanne Bobzien - 2012 - In B. Morison K. Ierodiakonou (ed.), Episteme, etc.: Essays in honour of Jonathan Barnes. OUP UK.
    The purpose of this paper is to challenge some widespread assumptions about the role of the modal axiom 4 in a theory of vagueness. In the context of vagueness, axiom 4 usually appears as the principle ‘If it is clear (determinate, definite) that A, then it is clear (determinate, definite) that it is clear (determinate, definite) that A’, or, more formally, CA → CCA. We show how in the debate over axiom 4 two different notions of clarity are in play (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  12. Higher-Order Thoughts, Neural Realization, and the Metaphysics of Consciousness.Rocco J. Gennaro - 2016 - In Consciousness: Integrating Eastern and Western Perspectives. New Delhi, India: New Age Publishers. pp. 83-102.
    The higher-order thought (HOT) theory of consciousness is a reductive representational theory of consciousness which says that what makes a mental state conscious is that there is a suitable HOT directed at that mental state. Although it seems that any neural realization of the theory must be somewhat widely distributed in the brain, it remains unclear just how widely distributed it needs to be. In section I, I provide some background and define some key terms. In section II, I (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13. First-Order Modal Logic in the Necessary Framework of Objects.Peter Fritz - 2016 - Canadian Journal of Philosophy 46 (4-5):584-609.
    I consider the first-order modal logic which counts as valid those sentences which are true on every interpretation of the non-logical constants. Based on the assumptions that it is necessary what individuals there are and that it is necessary which propositions are necessary, Timothy Williamson has tentatively suggested an argument for the claim that this logic is determined by a possible world structure consisting of an infinite set of individuals and an infinite set of worlds. He notes that (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  14.  86
    Higher-Order Intentionality and Dretske's View of Analytic Knowledge.Sudan A. Turner - manuscript
    Dretske makes arguments in which he suggests three levels of the intentionality of knowledge: (1) a low level belonging to law-like causal relationships between physical properties, (2) a middle level defined in terms of the intensionality of sentences describing knowledge of these properties, and (3) a highest level of human cognition. Acknowledging the need to explain humans’ analytic knowledge, however, he proposes that we know a proposition P analytically when we know that P entails Q, even though P and Q (...)
    Download  
     
    Export citation  
     
    Bookmark  
  15. Constructing Formal Semantics From an Ontological Perspective. The Case of Second-Order Logics.Thibaut Giraud - 2014 - Synthese 191 (10):2115-2145.
    In a first part, I defend that formal semantics can be used as a guide to ontological commitment. Thus, if one endorses an ontological view \(O\) and wants to interpret a formal language \(L\) , a thorough understanding of the relation between semantics and ontology will help us to construct a semantics for \(L\) in such a way that its ontological commitment will be in perfect accordance with \(O\) . Basically, that is what I call constructing formal semantics from (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Not Much Higher-Order Vagueness in Williamson’s ’Logic of Clarity’.Nasim Mahoozi & Thomas Mormann - manuscript
    This paper deals with higher-order vagueness in Williamson's 'logic of clarity'. Its aim is to prove that for 'fixed margin models' (W,d,α ,[ ]) the notion of higher-order vagueness collapses to second-order vagueness. First, it is shown that fixed margin models can be reformulated in terms of similarity structures (W,~). The relation ~ is assumed to be reflexive and symmetric, but not necessarily transitive. Then, it is shown that the structures (W,~) come along with naturally defined (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17.  24
    Review of Klein, Defining Sport. [REVIEW]Thornton Lockwood - 2018 - Reason Papers 40:99-104.
    Arriving at definitions in philosophy is as time-honored as it is controversial. Although learned reflection in the west about sport goes back at least to the time of ancient Greece, the sub-discipline of the philosophy of sport emerged in the world of Anglophone analytic philosophy in the 1970s. Shawn Klein’s edited volume, Defining Sport: Conceptions and Borderlines, is both the fruit of and a valuable contribution to such an emerging field (indeed, it is the first book-length study of its (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18.  64
    Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects.W. Conradie, V. Goranko & D. Vakarelov - 2005 - In Renate Schmidt, Ian Pratt-Hartmann, Mark Reynolds & Heinrich Wansing (eds.), Advances in Modal Logic, Volume 5. Kings College London Publ.. pp. 17-51.
    In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  19. Quantification and Logical Form.Andrea Iacona - 2015 - In Alessandro Torza (ed.), Quantifiers, Quantifiers, and Quantifiers. Springer. pp. 125-140.
    This paper deals with the logical form of quantified sentences. Its purpose is to elucidate one plausible sense in which quantified sentences can adequately be represented in the language of first-order logic. Section 1 introduces some basic notions drawn from general quantification theory. Section 2 outlines a crucial assumption, namely, that logical form is a matter of truth-conditions. Section 3 shows how the truth-conditions of quantified sentences can be represented in the language of first-order logic consistently (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  20. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  42
    Paraconsistent First-Order Logic with Infinite Hierarchy Levels of Contradiction.Jaykov Foukzon - manuscript
    In this paper paraconsistent first-order logic LP^{#} with infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^{#} is discussed.Axiomatical system HST^{#}as paraconsistent generalization of Hrbacek set theory HST is considered.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. The Emperor's New Phenomenology? The Empirical Case for Conscious Experience Without First-Order Representations.Hakwan Lau & Richard Brown - 2019 - In Adam Pautz & Daniel Stoljar (eds.), Blockheads! Essays on Ned Block's Philosophy of Mind and Consciousness. MIT Press.
    We discuss cases where subjects seem to enjoy conscious experience when the relevant first-order perceptual representations are either missing or too weak to account for the experience. Though these cases are originally considered to be theoretical possibilities that may be problematical for the higher-order view of consciousness, careful considerations of actual empirical examples suggest that this strategy may backfire; these cases may cause more trouble for first-order theories instead. Specifically, these cases suggest that (I) recurrent (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   12 citations  
  23.  80
    Elimination of Cuts in First-Order Finite-Valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - 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   13 citations  
  24. On the Expressive Power of First-Order Modal Logic with Two-Dimensional Operators.Alexander Kocurek - 2018 - Synthese 195 (10):4373-4417.
    Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive power of these (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  25. Modal Ontology and Generalized Quantifiers.Peter Fritz - 2013 - Journal of Philosophical Logic 42 (4):643-678.
    Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distinctions contingentists cannot draw. Some of these results are similar to well-known results on the relative expressivity of quantified modal logics with so-called inner and (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  26. 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  
  27. Logicism, Ontology, and the Epistemology of Second-Order Logic.Richard Kimberly Heck - 2018 - In Ivette Fred-Rivera & Jessica Leach (eds.), Being Necessary: Themes of Ontology and Modality from the Work of Bob Hale. Oxford: Oxford University Press. pp. 140-169.
    In two recent papers, Bob Hale has attempted to free second-order logic of the 'staggering existential assumptions' with which Quine famously attempted to saddle it. I argue, first, that the ontological issue is at best secondary: the crucial issue about second-order logic, at least for a neo-logicist, is epistemological. I then argue that neither Crispin Wright's attempt to characterize a `neutralist' conception of quantification that is wholly independent of existential commitment, nor Hale's attempt to characterize the second- (...) domain in terms of definability, can serve a neo-logicist's purposes. The problem, in both cases, is similar: neither Wright nor Hale is sufficiently sensitive to the demands that impredicativity imposes. Finally, I defend my own earlier attempt to finesse this issue, in "A Logic for Frege's Theorem", from Hale's criticisms. (shrink)
    Download  
     
    Export citation  
     
    Bookmark  
  28. Is Leibnizian Calculus Embeddable in First Order Logic?Piotr Błaszczyk, Vladimir Kanovei, Karin U. Katz, Mikhail G. Katz, Taras Kudryk, Thomas Mormann & David Sherry - 2017 - Foundations of Science 22 (4):73 - 88.
    To explore the extent of embeddability of Leibnizian infinitesimal calculus in first-order logic (FOL) and modern frameworks, we propose to set aside ontological issues and focus on pro- cedural questions. This would enable an account of Leibnizian procedures in a framework limited to FOL with a small number of additional ingredients such as the relation of infinite proximity. If, as we argue here, first order logic is indeed suitable for developing modern proxies for the inferential moves (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  29. A First-Order Modal Theodicy: God, Evil, and Religious Determinism.Gesiel Borges da Silva & Fábio Bertato - 2019 - South American Journal of Logic 5 (1):49-80.
    Edward Nieznanski developed in 2007 and 2008 two different systems in formal logic which deal with the problem of evil. Particularly, his aim is to refute a version of the logical problem of evil associated with a form of religious determinism. In this paper, we revisit his first system to give a more suitable form to it, reformulating it in first-order modal logic. The new resulting system, called N1, has much of the original basic structure, and many (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. A First-Order Logic Formalization of the Industrial Ontology Foundry Signature Using Basic Formal Ontology.Barry Smith, Farhad Ameri, Hyunmin Cheong, Dimitris Kiritsis, Dusan Sormaz, Chris Will & J. Neil Otte - 2019 - In Proceedings of the Joint Ontology Workshops (JOWO), Graz.
    Basic Formal Ontology (BFO) is a top-level ontology used in hundreds of active projects in scientific and other domains. BFO has been selected to serve as top-level ontology in the Industrial Ontologies Foundry (IOF), an initiative to create a suite of ontologies to support digital manufacturing on the part of representatives from a number of branches of the advanced manufacturing industries. We here present a first draft set of axioms and definitions of an IOF upper ontology descending from BFO. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. First-Order Quantifiers.G. Aldo Antonelli - manuscript
    In §21 of Grundgesetze der Arithmetik asks us to consider the forms: a a2 = 4 and a a > 0 and notices that they can be obtained from a φ(a) by replacing the function-name placeholder φ(ξ) by names for the functions ξ2 = 4 and ξ > 0 (and the placeholder cannot be replaced by names of objects or of functions of 2 arguments).
    Download  
     
    Export citation  
     
    Bookmark  
  32. Relevant First-Order Logic LP# and Curry’s Paradox Resolution.Jaykov Foukzon - 2015 - Pure and Applied Mathematics Journal Volume 4, Issue 1-1, January 2015 DOI: 10.11648/J.Pamj.S.2015040101.12.
    In 1942 Haskell B. Curry presented what is now called Curry's paradox which can be found in a logic independently of its stand on negation. In recent years there has been a revitalised interest in non-classical solutions to the semantic paradoxes. In this article the non-classical resolution of Curry’s Paradox and Shaw-Kwei' sparadox without rejection any contraction postulate is proposed. In additional relevant paraconsistent logic C ̌_n^#,1≤n<ω, in fact,provide an effective way of circumventing triviality of da Costa’s paraconsistent Set Theories〖NF〗n^C.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  33. Vanilla PP for Philosophers: A Primer on Predictive Processing.Wanja Wiese & Thomas Metzinger - 2017 - Philosophy and Predictive Processing.
    The goal of this short chapter, aimed at philosophers, is to provide an overview and brief explanation of some central concepts involved in predictive processing (PP). Even those who consider themselves experts on the topic may find it helpful to see how the central terms are used in this collection. To keep things simple, we will first informally define a set of features important to predictive processing, supplemented by some short explanations and an alphabetic glossary. -/- The features described (...)
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  34. Erratum to “The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories” Logic Journal of the IGPL, 16: 585–590. [REVIEW]Igor Oliveira & Walter Carnielli - 2009 - Logic Journal of the IGPL 17 (6):803-804.
    This note clarifies an error in the proof of the main theorem of “The Ricean Objection: An Analogue of Rice’s Theorem for First-Order Theories”, Logic Journal of the IGPL, 16(6): 585–590(2008).
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  35. 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) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. Twist-Valued Models for Three-Valued Paraconsistent Set Theory.Walter Carnielli & Marcelo E. Coniglio - 2021 - Logic and Logical Philosophy 30 (2):187-226.
    Boolean-valued models of set theory were independently introduced by Scott, Solovay and Vopěnka in 1965, offering a natural and rich alternative for describing forcing. The original method was adapted by Takeuti, Titani, Kozawa and Ozawa to lattice-valued models of set theory. After this, Löwe and Tarafder proposed a class of algebras based on a certain kind of implication which satisfy several axioms of ZF. From this class, they found a specific 3-valued model called PS3 which satisfies all the axioms of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  37. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  38. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Cementing Science. Understanding Science Through Its Development.Veli Virmajoki - 2019 - Dissertation, University of Turku
    In this book, I defend the present-centered approach in historiography of science (i.e. study of the history of science), build an account for causal explanations in historiography of science, and show the fruitfulness of the approach and account in when we attempt to understand science. -/- The present-centered approach defines historiography of science as a field that studies the developments that led to the present science. I argue that the choice of the targets of studies in historiography of science should (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Determination, Uniformity, and Relevance: Normative Criteria for Generalization and Reasoning by Analogy.Todd R. Davies - 1988 - In David H. Helman (ed.), Analogical Reasoning. Kluwer Academic Publishers. pp. 227-250.
    This paper defines the form of prior knowledge that is required for sound inferences by analogy and single-instance generalizations, in both logical and probabilistic reasoning. In the logical case, the first order determination rule defined in Davies (1985) is shown to solve both the justification and non-redundancy problems for analogical inference. The statistical analogue of determination that is put forward is termed 'uniformity'. Based on the semantics of determination and uniformity, a third notion of "relevance" is defined, both (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  41. 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. What is Nominalistic Mereology?Jeremy Meyers - 2012 - Journal of Philosophical Logic 43 (1):71-108.
    Hybrid languages are introduced in order to evaluate the strength of “minimal” mereologies with relatively strong frame definability properties. Appealing to a robust form of nominalism, I claim that one investigated language \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {H}_{\textsf {m}}$\end{document} is maximally acceptable for nominalistic mereology. In an extension \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {H}_{\textsf {gem}}$\end{document} of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$\mathcal {H}_{\textsf {m}}$\end{document}, a (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  43. A Logical Approach to Reasoning by Analogy.Todd R. Davies & Stuart J. Russell - 1987 - In John P. McDermott (ed.), Proceedings of the 10th International Joint Conference on Artificial Intelligence (IJCAI'87). Morgan Kaufmann Publishers. pp. 264-270.
    We analyze the logical form of the domain knowledge that grounds analogical inferences and generalizations from a single instance. The form of the assumptions which justify analogies is given schematically as the "determination rule", so called because it expresses the relation of one set of variables determining the values of another set. The determination relation is a logical generalization of the different types of dependency relations defined in database theory. Specifically, we define determination as a relation between schemata of (...) order logic that have two kinds of free variables: (1) object variables and (2) what we call "polar" variables, which hold the place of truth values. Determination rules facilitate sound rule inference and valid conclusions projected by analogy from single instances, without implying what the conclusion should be prior to an inspection of the instance. They also provide a way to specify what information is sufficiently relevant to decide a question, prior to knowledge of the answer to the question. (shrink)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  44. First- and Second-Order Logic of Mass Terms.Peter Roeper - 2004 - Journal of Philosophical Logic 33 (3):261-297.
    Provided here is an account, both syntactic and semantic, of first-order and monadic second-order quantification theory for domains that may be non-atomic. Although the rules of inference largely parallel those of classical logic, there are important differences in connection with the identification of argument places and the significance of the identity relation.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  45. Commodification of Human Tissue.Herjeet Marway, Sarah-Louise Johnson & Heather Widdows - 2014 - Handbook of Global Bioethics.
    Commodification is a broad and crosscutting issue that spans debates in ethics (from prostitution to global market practices) and bioethics (from the sale of body parts to genetic enhancement). There has been disagreement, however, over what constitutes commodification, whether it is happening, and whether it is of ethical import. This chapter focuses on one area of the discussion in bioethics – the commodification of human tissue – and addresses these questions – about the characteristics of commodification, its pervasiveness, and ethical (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  46. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  47. There Must Be A First: Why Thomas Aquinas Rejects Infinite, Essentially Ordered, Causal Series.Caleb Cohoe - 2013 - British Journal for the History of Philosophy 21 (5):838 - 856.
    Several of Thomas Aquinas's proofs for the existence of God rely on the claim that causal series cannot proceed in infinitum. I argue that Aquinas has good reason to hold this claim given his conception of causation. Because he holds that effects are ontologically dependent on their causes, he holds that the relevant causal series are wholly derivative: the later members of such series serve as causes only insofar as they have been caused by and are effects of the earlier (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  48.  52
    Algorithmic Correspondence and Completeness in Modal Logic. IV. Semantic Extensions of SQEMA.Willem Conradie & Valentin Goranko - 2008 - Journal of Applied Non-Classical Logics 18 (2-3):175-211.
    In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  49. The Significance of Evidence-Based Reasoning in Mathematics, Mathematics Education, Philosophy, and the Natural Sciences.Bhupinder Singh Anand - 2020 - Mumbai: DBA Publishing (First Edition).
    In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. A Completenesss Theorem for a 3-Valued Semantics for a First-Order Language.Christopher Gauker - manuscript
    This document presents a Gentzen-style deductive calculus and proves that it is complete with respect to a 3-valued semantics for a language with quantifiers. The semantics resembles the strong Kleene semantics with respect to conjunction, disjunction and negation. The completeness proof for the sentential fragment fills in the details of a proof sketched in Arnon Avron (2003). The extension to quantifiers is original but uses standard techniques.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
1 — 50 / 1000