Results for ' quantifiers'

953 found
Order:
  1. M. Abad Varieties of Three-valued.A. M. Suardiaz A. Quantifier - forthcoming - Studia Logica.
  2. Barry Richards.Temporal Quantifiers Tenses & Semantic Innocence - 1987 - In Ernest LePore, New directions in semantics. Orlando: Academic Press. pp. 337.
     
    Export citation  
     
    Bookmark  
  3. Dag Westerstahl.Branching Generalized Quantifiers - 1987 - In Peter Gärdenfors, Generalized Quantifiers. Reidel Publishing Company. pp. 269.
    No categories
     
    Export citation  
     
    Bookmark  
  4. Jon Barwise.Noun Phrases & Generalized Quantifiers - 1987 - In Peter Gärdenfors, Generalized Quantifiers. Reidel Publishing Company. pp. 31--1.
     
    Export citation  
     
    Bookmark  
  5.  20
    Learning complex action models with quantifiers and logical implications.Hankz Hankui Zhuo, Qiang Yang, Derek Hao Hu & Lei Li - 2010 - Artificial Intelligence 174 (18):1540-1569.
  6. Perdurantism, Universalism and Quantifiers.Achille C. Varzi - 2003 - Australasian Journal of Philosophy 81 (2):208-215.
    I argue that the conjunction of perdurantism (the view that objects are temporally extended) and universalism (the thesis that any old class of things has a mereological fusion) gives rise to undesired complications when combined with certain plausible assumptions concerning the semantics of tensed statements.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   30 citations  
  7.  31
    Correspondence and Completeness for Generalized Quantifiers.Natasha Alechina & Michiel van Lambalgen - 1995 - Logic Journal of the IGPL 3 (2-3):167-190.
  8. Chapter 3: The Semantics of Special Quantifiers in Predicate Position.Friederike Moltmann - 2012 - In Abstract Objects and the Semantics of Natural Language. Oxford, United Kingdom: Oxford University Press.
    This chapter argues that special quantifiers such as 'something' when occurring in argument position are not ordinary or substitutional quantifiers; rather they have a reifying force introducing a domain of tropes or kinds of tropes to quantify over.
    Direct download  
     
    Export citation  
     
    Bookmark   18 citations  
  9.  84
    (1 other version)Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
  10. First order predicate logic with generalized quantifiers.Per Lindström - 1966 - Theoria 32 (3):186--195.
  11. (1 other version)Mass and count quantifiers.Jim Higginbotham - 1994 - Linguistics and Philosophy 17 (5):447 - 480.
  12.  27
    Canonical signed calculi with multi-ary quantifiers.Anna Zamansky & Arnon Avron - 2012 - Annals of Pure and Applied Logic 163 (7):951-960.
  13.  16
    First-order concatenation theory with bounded quantifiers.Lars Kristiansen & Juvenal Murwanashyaka - 2020 - Archive for Mathematical Logic 60 (1):77-104.
    We study first-order concatenation theory with bounded quantifiers. We give axiomatizations with interesting properties, and we prove some normal-form results. Finally, we prove a number of decidability and undecidability results.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  6
    The Reducibility of Generalized Syllogisms with the Quantifiers in Square {not all} and Square {most}.Zhipeng Yu & Jing Xu - 2024 - Philosophy International Journal 7 (4):1-4.
    To explore the reducibility of non-trivial generalized syllogisms with the quantifiers in Square {not all} and Square {most}, this paper first gives the formalization of generalized syllogisms on the basis of set theory, and then proves the validity of the generalized syllogism EMO-3 by first-order logic and generalized quantifier theory; Finally, with the help of some reductive operations, the other 20 valid generalized syllogisms are deduced from the syllogism EMO-3. In other words, there are the reducible relationships between/among the (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  15. The substitution interpretation of the quantifiers.J. Michael Dunn & Nuel D. Belnap - 1968 - Noûs 2 (2):177-185.
  16. Descriptions: Predicates or quantifiers?Berit Brogaard - 2007 - Australasian Journal of Philosophy 85 (1):117 – 136.
    In this paper I revisit the main arguments for a predicate analysis of descriptions in order to determine whether they do in fact undermine Russell's theory. I argue that while the arguments without doubt provide powerful evidence against Russell's original theory, it is far from clear that they tell against a quantificational account of descriptions.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  17.  46
    Noun Phrases, Quantifiers, and Generic Names, EJ LOWE Frege and Russell have taught us that indefinite and plural noun phrases in natural language often function as quantifier expressions rather than as referring expressions, despite possessing many syntactical simi-larities with names. But it can be shown that in some of their most im.Catherine Jl Talmage & Mark Mercer - 1991 - Philosophy 66 (257).
  18. If and when if -clauses can restrict quantifiers.Kai von Fintel - manuscript
    The interpretation of if -clauses in the scope of ordinary quantifiers has provoked semanticists into extraordinary measures, such as abandoning compositionality or claiming that if has no meaning. We argue that if -clauses have a normal conditional meaning, even in the scope of ordinary quantifiers, and that the trick is to have the right semantics for conditionals.
     
    Export citation  
     
    Bookmark   28 citations  
  19.  37
    Probing the mental representation of quantifiers.Sandro Pezzelle, Raffaella Bernardi & Manuela Piazza - 2018 - Cognition 181 (C):117-126.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  20.  23
    Elementary-base cirquent calculus II: Choice quantifiers.Giorgi Japaridze - forthcoming - Logic Journal of the IGPL.
    Cirquent calculus is a novel proof theory permitting component-sharing between logical expressions. Using it, the predecessor article ‘Elementary-base cirquent calculus I: Parallel and choice connectives’ built the sound and complete axiomatization $\textbf{CL16}$ of a propositional fragment of computability logic. The atoms of the language of $\textbf{CL16}$ represent elementary, i.e. moveless, games and the logical vocabulary consists of negation, parallel connectives and choice connectives. The present paper constructs the first-order version $\textbf{CL17}$ of $\textbf{CL16}$, also enjoying soundness and completeness. The language of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  21.  43
    Barwise: Abstract Model Theory and Generalized Quantifiers.Jouko Va An Anen - 2004 - Bulletin of Symbolic Logic 10 (1):37-53.
    §1. Introduction. After the pioneering work of Mostowski [29] and Lindström [23] it was Jon Barwise's papers [2] and [3] that brought abstract model theory and generalized quantifiers to the attention of logicians in the early seventies. These papers were greeted with enthusiasm at the prospect that model theory could be developed by introducing a multitude of extensions of first order logic, and by proving abstract results about relationships holding between properties of these logics. Examples of such properties areκ-compactness.Any (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  22.  97
    Constructive generalized quantifiers.Göran Sundholm - 1989 - Synthese 79 (1):1 - 12.
  23.  65
    (1 other version)The decision problem for some classes of sentences without quantifiers.J. C. C. McKinsey - 1943 - Journal of Symbolic Logic 8 (2):61-76.
  24. A Note on the Representation of Branching Quantifiers.F. Guenthner & J. P. Hoepelman - 1976 - Theoretical Linguistics 3:285--289.
  25.  79
    An intensional parametric semantics for vague quantifiers.Shalom Lappin - 2000 - Linguistics and Philosophy 23 (6):599-620.
  26. Natural language, sortal reducibility and generalized quantifiers.Edward L. Keenan - 1993 - Journal of Symbolic Logic 58 (1):314-325.
    Recent work in natural language semantics leads to some new observations on generalized quantifiers. In § 1 we show that English quantifiers of type $ $ are booleanly generated by their generalized universal and generalized existential members. These two classes also constitute the sortally reducible members of this type. Section 2 presents our main result--the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form Q1x 1⋯ Qnx nRx 1⋯ xn and q1x 1⋯ (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  27.  72
    Interpretations of quantifiers.Thomas Baldwin - 1979 - Mind 88 (350):215-240.
  28. The Moral Law and The Good in Temporal Modal Logic with Propositional Quantifiers.Daniel Rönnedal - 2020 - Australasian Journal of Logic 17 (1):22-69.
    The Moral Law is fulfilled iff everything that ought to be the case is the case, and The Good is realised in a possible world w at a time t iff w is deontically accessible from w at t. In this paper, I will introduce a set of temporal modal deontic systems with propositional quantifiers that can be used to prove some interesting theorems about The Moral Law and The Good. First, I will describe a set of systems without (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29.  23
    Richard Montague. Logical necessity, physical necessity, ethics, and quantifiers. Inquiry , vol. 3 , pp. 259–269.A. Bayart - 1967 - Journal of Symbolic Logic 32 (3):400-401.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  30.  82
    On proper quantifiers I.Ludwik Borkowski - 1958 - Studia Logica 8 (1):65 - 130.
  31.  32
    Syllogisms with statistical quantifiers.Bruce E. R. Thompson - 1986 - Notre Dame Journal of Formal Logic 27 (1):93-103.
  32.  55
    Montague Type Semantics for Modal Logics with Propositional Quantifiers.Dov M. Gabbay - 1971 - Mathematical Logic Quarterly 17 (1):245-249.
  33. Certain Verbs Are Syntactically Explicit Quantifiers.Anna Szabolcsi - 2011 - The Baltic International Yearbook of Cognition, Logic and Communication 6:5.
    Quantification over individuals, times, and worlds can in principle be made explicit in the syntax of the object language, or left to the semantics and spelled out in the meta-language. The traditional view is that quantification over individuals is syntactically explicit, whereas quantification over times and worlds is not. But a growing body of literature proposes a uniform treatment. This paper examines the scopal interaction of aspectual raising verbs (begin), modals (can), and intensional raising verbs (threaten) with quantificational subjects in (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  71
    Substitutional Quantification and Le'sniewskian Quantifiers.Guido Küng & John Thomas Canty - 1970 - Theoria 36 (2):165-182.
  35.  34
    Preschoolers sometimes know less than we think: The use of quantifiers to solve addition and subtraction tasks.Belinda Blevins-Knabe, Robert G. Cooper, Prentice Starkey, Patty Goth Mace & Ed Leitner - 1987 - Bulletin of the Psychonomic Society 25 (1):31-34.
  36. Definite descriptions and negative existential quantifiers.Paul Elbourne - 2018 - Philosophical Studies 175 (7):1597-1612.
    Previous theorists have claimed that Russell’s theory of definite descriptions gives the wrong truth conditions to sentences in which definite descriptions are embedded under certain other operators; but the other operators used, such as conditionals and propositional attitude verbs, have introduced intensional and hyperintensional complications that might be thought to obscure the point against Russell. This paper shows that the same kind of problem arises when the operator in question allows the context to be extensional. It is further argued that (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  37. Quantifiers in TIME and SPACE. Computational Complexity of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2009 - Dissertation, University of Amsterdam
    In the dissertation we study the complexity of generalized quantifiers in natural language. Our perspective is interdisciplinary: we combine philosophical insights with theoretical computer science, experimental cognitive science and linguistic theories. -/- In Chapter 1 we argue for identifying a part of meaning, the so-called referential meaning (model-checking), with algorithms. Moreover, we discuss the influence of computational complexity theory on cognitive tasks. We give some arguments to treat as cognitively tractable only those problems which can be computed in polynomial (...)
    Direct download  
     
    Export citation  
     
    Bookmark   13 citations  
  38.  31
    A Preliminary Study of MV-Algebras with Two Quantifiers Which Commute.Aldo Figallo Orellano - 2016 - Studia Logica 104 (5):931-956.
    In this paper we investigate the class of MV-algebras equipped with two quantifiers which commute as a natural generalization of diagonal-free two-dimensional cylindric algebras. In the 40s, Tarski first introduced cylindric algebras in order to provide an algebraic apparatus for the study of classical predicate calculus. The diagonal–free two-dimensional cylindric algebras are special cylindric algebras. The treatment here of MV-algebras is done in terms of implication and negation. This allows us to simplify some results due to Di Nola and (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  39.  15
    The World of the Academic Quantifiers: The Columbia University Family and its Connections.Stephen Turner - 1992 - In M. Blumer, K. Bales & K. K. Sklar, The Social Survey in Historical Perspective, 1880–1940. Cambridge University Press. pp. 269-290.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  40. The Role of Situations in Generalized Quantifiers.Robin Cooper - 1996 - In Shalom Lappin, The handbook of contemporary semantic theory. Cambridge, Mass., USA: Blackwell Reference. pp. 65--86.
  41.  27
    (1 other version)Hilbert∈-symbol in the presence of generalized quantifiers.Xavier Caicedo - 1991 - Bulletin of the Section of Logic 20 (3/4):85-86.
  42.  7
    A note concerning the rules of inference for quantifiers.Roman Suszko - 1965 - Archive for Mathematical Logic 7 (3-4):124-127.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  43.  29
    Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski Jakub Szymanik & M. Mostowski - 2007 - Bulletin of Symbolic Logic 13:281-282.
  44.  70
    Almost Everywhere Elimination of Probability Quantifiers.H. Jerome Keisler & Wafik Boulos Lotfallah - 2009 - Journal of Symbolic Logic 74 (4):1121 - 1142.
    We obtain an almost everywhere quantifier elimination for (the noncritical fragment of) the logic with probability quantifiers, introduced by the first author in [10]. This logic has quantifiers like $\exists ^{ \ge 3/4} y$ which says that "for at least 3/4 of all y". These results improve upon the 0-1 law for a fragment of this logic obtained by Knyazev [11]. Our improvements are: 1. We deal with the quantifier $\exists ^{ \ge r} y$ , where y is (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  45.  43
    Questions and Quantifiers.Mark A. Brown - 1990 - Theoria 56 (1-2):62-84.
  46.  43
    On bracketing names and quantifiers in first-order logic.Jacek Pasniczek - 1999 - History and Philosophy of Logic 20 (3-4):239-304.
  47.  25
    Limited universal and existential quantifiers in commutative partially ordered recursive arithmetics.M. T. Partis - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):17-23.
  48. Tense operators versus quantifiers.Terence Parsons - 1973 - Journal of Philosophy 70 (18):609-610.
  49.  31
    On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem löwenheim theorems and compactness of related quantifiers.Matatyahu Rubin & Saharon Shelah - 1980 - Journal of Symbolic Logic 45 (2):265-283.
    THEOREM 1. (⋄ ℵ 1 ) If B is an infinite Boolean algebra (BA), then there is B 1 such that $|\operatorname{Aut} (B_1)| \leq B_1| = \aleph_1$ and $\langle B_1, \operatorname{Aut} (B_1)\rangle \equiv \langle B, \operatorname{Aut}(B)\rangle$ . THEOREM 2. (⋄ ℵ 1 ) There is a countably compact logic stronger than first-order logic even on finite models. This partially answers a question of H. Friedman. These theorems appear in §§ 1 and 2. THEOREM 3. (a) (⋄ ℵ 1 ) If (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  50.  64
    Multiple quantification and the use of special quantifiers in early sixteenth century logic.E. J. Ashworth - 1978 - Notre Dame Journal of Formal Logic 19 (4):599-613.
1 — 50 / 953