Results for 'first-order definability'

983 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. First-order belief and paraconsistency.Srećko Kovač - 2009 - Logic and Logical Philosophy 18 (2):127-143.
    A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as a subset. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. Categories of First-Order Quantifiers.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Cham, Switzerland: Springer- Birkhauser,. 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  
  4. 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  
  5. 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   2 citations  
  6. 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  
  7. 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   3 citations  
  8. Higher-Order Thoughts, Neural Realization, and the Metaphysics of Consciousness.Rocco J. Gennaro - 2016 - In Consciousness. New York: Routledge. 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   3 citations  
  9. Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 1998 - 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   5 citations  
  10. Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 1998 - 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 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  
  11. Pure Logic and Higher-order Metaphysics.Christopher Menzel - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, due (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  12. 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   9 citations  
  13. 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   2 citations  
  14. Quantification and Logical Form.Andrea Iacona - 2015 - In Alessandro Torza (ed.), Quantifiers, Quantifiers, and Quantifiers. Themes in Logic, Metaphysics, and Language. (Synthese Library vol. 373). 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   2 citations  
  15. Neutrosophic Actions, Prevalence Order, Refinement of Neutrosophic Entities, and Neutrosophic Literal Logical Operators.Florentin Smarandache - 2015 - Neutrosophic Sets and Systems 10:102-107.
    In this paper, we define for the first time three neutrosophic actions and their properties. We then introduce the prevalence order on {T, I, F} with respect to a given neutrosophic operator “o”, which may be subjective - as defined by the neutrosophic experts; and the refinement of neutrosophic entities <A>, <neutA>, and <antiA> . Then we extend the classical logical operators to neutrosophic literal logical operators and to refined literal logical operators, and we define the refinement neutrosophic (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects.W. Conradie, V. Goranko & D. Vakarelov - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. 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   5 citations  
  17. 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  
  18. Defining Generative Artificial Intelligence: An Attempt to Resolve the Confusion about Diffusion.Raphael Ronge, Markus Maier & Benjamin Rathgeber - manuscript
    The concept of Generative Artificial Intelligence (GenAI) is ubiquitous in the public and semi-technical domain, yet rarely defined precisely. We clarify main concepts that are usually discussed in connection to GenAI and argue that one ought to distinguish between the technical and the public discourse. In order to show its complex development and associated conceptual ambiguities, we offer a historical-systematic reconstruction of GenAI and explicitly discuss two exemplary cases: the generative status of the Large Language Model BERT and the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19.  72
    Logic as an internal organisation of language.Boris Čulina - 2024 - Science and Philosophy 12 (1):62-71.
    Contemporary semantic description of logic is based on the ontology of all possible interpretations, an insufficiently clear metaphysical concept. In this article, logic is described as the internal organization of language. Logical concepts -- logical constants, logical truths, and logical consequence -- 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. 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   11 citations  
  21. If It's Clear, Then It's Clear That It's Clear, or is It? Higher-Order Vagueness and the S4 Axiom.Susanne Bobzien - 2011 - In Ben Morison & Katerina Ierodiakonou (eds.), Episteme, etc.: Essays in honour of Jonathan Barnes. Oxford, GB: Oxford University Press.
    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   17 citations  
  22. 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   11 citations  
  23. 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  
  24. Residuated bilattices.Umberto Rivieccio & Ramon Jansana - 2012 - Soft Computing 16 (3):493-504.
    We introduce a new product bilattice con- struction that generalizes the well-known one for interlaced bilattices and others that were developed more recently, allowing to obtain a bilattice with two residuated pairs as a certain kind of power of an arbitrary residuated lattice. We prove that the class of bilattices thus obtained is a variety, give a finite axiomatization for it and characterize the congruences of its members in terms of those of their lat- tice factors. Finally, we show how (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25. 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  
  26. Will I die (decease)? – I immortal (deathless) (how to realize immortality (deathlessness) in first person perspective) (Скончаюсь? – я бессмертен (как осознать бессмертие «от первого лица»)).Aleksandr Zhikharev - manuscript
    Will I die? As a hypothesis, in my natural scientific understanding, the psyche, is nothing more than, and exclusively just some states of my living brain – I will die as a result of his death. -/- In presented answer, psyche – itself own immediate reality itself, that is – undoubted. -/- This work was performed in reality “in the first person” (“subjective reality”, “phenomenal consciousness”). To realize, how, what it is the reality of the “in the first (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. A generic Solution to the Sorites Paradox.Susanne Bobzien - 2024 - Erkenntnis 2024 (Online):1-40.
    ABSTRACT: This paper offers a generic revenge-proof solution to the Sorites paradox that is compatible with several philosophical approaches to vagueness, including epistemicism, supervaluationism, psychological contextualism and intuitionism. The solution is traditional in that it rejects the Sorites conditional and proposes a modally expressed weakened conditional instead. The modalities are defined by the first-order logic QS4M+FIN. (This logic is a modal companion to the intermediate logic QH+KF, which places the solution between intuitionistic and classical logic.) Borderlineness is introduced (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. Logicism, Ontology, and the Epistemology of Second-Order Logic.Richard Kimberly Heck - 2018 - In Ivette Fred Rivera & Jessica Leech (eds.), Being Necessary: Themes of Ontology and Modality from the Work of Bob Hale. Oxford, England: 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  
  29. Vagueness and Quantification.Andrea Iacona - 2016 - Journal of Philosophical Logic 45 (5):579-602.
    This paper deals with the question of what it is for a quantifier expression to be vague. First it draws a distinction between two senses in which quantifier expressions may be said to be vague, and provides an account of the distinction which rests on independently grounded assumptions. Then it suggests that, if some further assumptions are granted, the difference between the two senses considered can be represented at the formal level. Finally, it outlines some implications of the account (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  30.  79
    Typicality à la Russell in Set Theory.Athanassios Tzouvaras - 2022 - Notre Dame Journal of Formal Logic 63 (2).
    We adjust the notion of typicality originated with Russell, which was introduced and studied in a previous paper for general first-order structures, to make it expressible in the language of set theory. The adopted definition of the class ${\rm NT}$ of nontypical sets comes out as a natural strengthening of Russell's initial definition, which employs properties of small (minority) extensions, when the latter are restricted to the various levels $V_\zeta$ of $V$. This strengthening leads to defining ${\rm NT}$ (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. Naïve Truth and the Evidential Conditional.Andrea Iacona & Lorenzo Rossi - 2024 - Journal of Philosophical Logic 53 (2):559-584.
    This paper develops the idea that valid arguments are equivalent to true conditionals by combining Kripke’s theory of truth with the evidential account of conditionals offered by Crupi and Iacona. As will be shown, in a first-order language that contains a naïve truth predicate and a suitable conditional, one can define a validity predicate in accordance with the thesis that the inference from a conjunction of premises to a conclusion is valid when the corresponding conditional is true. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. 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   74 citations  
  33. A Metasemantic Analysis of Gödel's Slingshot Argument.Hans-Peter Leeb - manuscript
    Gödel’s slingshot-argument proceeds from a referential theory of definite descriptions and from the principle of compositionality for reference. It outlines a metasemantic proof of Frege’s thesis that all true sentences refer to the same object—as well as all false ones. Whereas Frege drew from this the conclusion that sentences refer to truth-values, Gödel rejected a referential theory of definite descriptions. By formalising Gödel’s argument, it is possible to reconstruct all premises that are needed for the derivation of Frege’s thesis. For (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - unknown
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable propositions, (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  35. Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - 2022 - Review of Symbolic Logic 15 (3):771-806.
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same negative results hold (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  36. Categorical Quantification.Constantin C. Brîncuș - forthcoming - Bulletin of Symbolic Logic:1-27.
    Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  37. First-Order Logic with Adverbs.Tristan Grøtvedt Haze - forthcoming - Logic and Logical Philosophy:1-36.
    This paper introduces two languages and associated logics designed to afford perspicuous representations of a range of natural language arguments involving adverbs and the like: first-order logic with basic adverbs (FOL-BA) and first-order logic with scoped adverbs (FOL-SA). The guiding logical idea is that an adverb can come between a term and the rest of the statement it is a part of, resulting in a logically stronger statement. I explain various interesting challenges that arise in the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38. 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   15 citations  
  39. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  40. Existence, really? Tacit disagreements about “existence” in disputes about group minds and corporate agents.Johannes Himmelreich - 2019 - Synthese 198 (5):4939-4953.
    A central dispute in social ontology concerns the existence of group minds and actions. I argue that some authors in this dispute rely on rival views of existence without sufficiently acknowledging this divergence. I proceed in three steps in arguing for this claim. First, I define the phenomenon as an implicit higher-order disagreement by drawing on an analysis of verbal disputes. Second, I distinguish two theories of existence—the theory-commitments view and the truthmaker view—in both their eliminativist and their (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  41. An argument for the impossibility of machine intelligence (preprint).Jobst Landgrebe & Barry Smith - 2021 - Arxiv.
    Since the noun phrase `artificial intelligence' (AI) was coined, it has been debated whether humans are able to create intelligence using technology. We shed new light on this question from the point of view of themodynamics and mathematics. First, we define what it is to be an agent (device) that could be the bearer of AI. Then we show that the mainstream definitions of `intelligence' proposed by Hutter and others and still accepted by the AI community are too weak (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42. Dynamic Montague grammar.Martin Stokhof - 1990 - In L. Kalman (ed.), Proceedings of the Second Symposion on Logic and Language, Budapest, Eotvos Lorand University Press, 1990, pp. 3-48. Budapest: Eotvos Lorand University Press. pp. 3-48.
    In Groenendijk & Stokhof [1989] a system of dynamic predicate logic (DPL) was developed, as a compositional alternative for classical discourse representation theory (DRT ). DPL shares with DRT the restriction of being a first-order system. In the present paper, we are mainly concerned with overcoming this limitation. We shall define a dynamic semantics for a typed language with λ-abstraction which is compatible with the semantics DPL specifies for the language of first-order predicate logic. We shall (...)
    Download  
     
    Export citation  
     
    Bookmark   76 citations  
  43. 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  
  44. Objects are (not) ...Friedrich Wilhelm Grafe - 2024 - Archive.Org.
    My goal in this paper is, to tentatively sketch and try defend some observations regarding the ontological dignity of object references, as they may be used from within in a formalized language. -/- Hence I try to explore, what properties objects are presupposed to have, in order to enter the universe of discourse of an interpreted formalized language. -/- First I review Frege′s analysis of the logical structure of truth value definite sentences of scientific colloquial language, to draw (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Synthetic proofs.Salman Panahy - 2023 - Synthese 201 (2):1-25.
    This is a contribution to the idea that some proofs in first-order logic are synthetic. Syntheticity is understood here in its classical geometrical sense. Starting from Jaakko Hintikka’s original idea and Allen Hazen’s insights, this paper develops a method to define the ‘graphical form’ of formulae in monadic and dyadic fraction of first-order logic. Then a synthetic inferential step in Natural Deduction is defined. A proof is defined as synthetic if it includes at least one synthetic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. (1 other version)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):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  
  47. O logici i metafizici vremena [On the logic and metaphysics of time].Srećko Kovač - 2009 - In Damir Barbarić (ed.), Vrijeme metamorfoza: uz 'Metamorfoze metafizike' Marijana Cipre [The Time of Metamorphoses : on the 'Metamorphoses of Metaphysics' by Marijan Cipra]. Matica hrvatska. pp. 33-59.
    The basic principles of Cipra's metaphysics (according to his book "Metamorphoses of Metaphysics") are analyzed with respect to Cipra's request for the revision of classical logical principles (of identity, excluded middle and contradiction). In Cipra's metaphysics, the principle of identity holds for being, necessity and past only, the principle of excluded middle does not hold for coming-to-be, possibility and present, and the principle of contradiction does not hold for the actuality, reality (freedom) and future. A propositional and first-order (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. 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   8 citations  
  49. Neutrosophic Lattices.Vasantha Kandasamy & Florentin Smarandache - 2014 - Neutrosophic Sets and Systems 2:42-47.
    In this paper authors for the first time define a new notion called neutrosophic lattices. We define few properties related with them. Three types of neutrosophic lattices are defined and the special properties about these new class of lattices are discussed and developed. This paper is organised into three sections. First section introduces the concept of partially ordered neutrosophic set and neutrosophic lattices. Section two introduces different types of neutrosophic lattices and the final section studies neutrosophic Boolean algebras. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. 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   3 citations  
1 — 50 / 983