Search results for 'quantifier' (try it on Scholar)

1000+ found
Sort by:
  1. Marcus Rossberg, On the Logic of Quantifier Variance.score: 24.0
    Eli Hirsch recently suggested the metaontological doctrine of so-called "quantifier variance", according to which ontological disputes—e.g. concerning the question whether arbitrary, possibly scattered, mereological fusions exist, in the sense that these are recognised as objects proper in our ontology—can be defused as insubstantial. His proposal is that the meaning of the quanti er `there exists' varies in such debates: according to one opponent in this dispute, some existential statement claiming the existence of, e.g., a scattered object is true, according (...)
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  2. Anders John (2012). Aquinas and Quantifier Mistakes. International Journal for Philosophy of Religion 71 (2):137-143.score: 24.0
    In his “Third Way” Aquinas appears to argue in a way that relies upon shifting quantifiers in a fallacious way. Some have tried to save this and other parts of the “Third Way” by introducing sophisticated logical and metaphysical machinery. Alternatively, Aquinas’ apparently fallacious quantifier shift can be seen to be part of a valid argument if we supply a simple premise which an Aristotelian natural philosopher would surely hold. In this short paper, I consider candidates for this premise, (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  3. Tommaso Cortonesi, Enrico Marchioni & Franco Montagna (2010). Quantifier Elimination and Other Model-Theoretic Properties of BL-Algebras. Notre Dame Journal of Formal Logic 52 (4):339-379.score: 24.0
    This work presents a model-theoretic approach to the study of first-order theories of classes of BL-chains. Among other facts, we present several classes of BL-algebras, generating the whole variety of BL-algebras, whose first-order theory has quantifier elimination. Model-completeness and decision problems are also investigated. Then we investigate classes of BL-algebras having (or not having) the amalgamation property or the joint embedding property and we relate the above properties to the existence of ultrahomogeneous models.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. H. Jerome Keisler (1998). Quantifier Elimination for Neocompact Sets. Journal of Symbolic Logic 63 (4):1442-1472.score: 24.0
    We shall prove quantifier elimination theorems for neocompact formulas, which define neocompact sets and are built from atomic formulas using finite disjunctions, infinite conjunctions, existential quantifiers, and bounded universal quantifiers. The neocompact sets were first introduced to provide an easy alternative to nonstandard methods of proving existence theorems in probability theory, where they behave like compact sets. The quantifier elimination theorems in this paper can be applied in a general setting to show that the family of neocompact sets (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  5. A. Cordón-Franco, A. Fernández-Margarit & F. F. Lara-Martín (2004). On the Quantifier Complexity of Δ N+1 (T)– Induction. Archive for Mathematical Logic 43 (3):371-398.score: 24.0
    In this paper we continue the study of the theories IΔ n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class of theories such that IΔ n+1 (T) is Π n+2 –axiomatizable. In particular, IΔ n+1 (IΔ n+1 ) gives an axiomatization of Th Π n+2 (IΔ n+1 ) and is not finitely axiomatizable. This fact relates the fragment IΔ n+1 (IΔ n+1 ) to (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  6. Yalin Firat Çelikler (2007). Quantifier Elimination for the Theory of Algebraically Closed Valued Fields with Analytic Structure. Mathematical Logic Quarterly 53 (3):237-246.score: 24.0
    The theory of algebraically closed non-Archimedean valued fields is proved to eliminate quantifiers in an analytic language similar to the one used by Cluckers, Lipshitz, and Robinson. The proof makes use of a uniform parameterized normalization theorem which is also proved in this paper. This theorem also has other consequences in the geometry of definable sets. The method of proving quantifier elimination in this paper for an analytic language does not require the algebraic quantifier elimination theorem of Weispfenning, (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  7. Ben Ellison, Jonathan Fleischmann, Dan McGinn & Wim Ruitenburg (2008). Quantifier Elimination for a Class of Intuitionistic Theories. Notre Dame Journal of Formal Logic 49 (3):281-293.score: 24.0
    From classical, Fraïissé-homogeneous, ($\leq \omega$)-categorical theories over finite relational languages, we construct intuitionistic theories that are complete, prove negations of classical tautologies, and admit quantifier elimination. We also determine the intuitionistic universal fragments of these theories.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  8. Kimiko Nakanishi (2012). The Scope of Even and Quantifier Raising. Natural Language Semantics 20 (2):115-136.score: 24.0
    This paper addresses the question of whether the preverbal even (VP-even) embedded in a nonfinite clause can take wide scope (e.g., Bill refused to even drink WATER). The paper presents novel evidence for wide scope VP-even that is independent of the presuppositions of even. The evidence is based on examples of antecedent-contained deletion (ACD), where embedded VP-even associates with a nominal constituent (or part of it) that raises out of the embedded clause via quantifier raising. Assuming that even must (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  9. Enrico Marchioni (2012). Amalgamation Through Quantifier Elimination for Varieties of Commutative Residuated Lattices. Archive for Mathematical Logic 51 (1-2):15-34.score: 24.0
    This work presents a model-theoretic approach to the study of the amalgamation property for varieties of semilinear commutative residuated lattices. It is well-known that if a first-order theory T enjoys quantifier elimination in some language L, the class of models of the set of its universal consequences ${\rm T_\forall}$ has the amalgamation property. Let ${{\rm Th}(\mathbb{K})}$ be the theory of an elementary subclass ${\mathbb{K}}$ of the linearly ordered members of a variety ${\mathbb{V}}$ of semilinear commutative residuated lattices. We show (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  10. Philipp Gerhardy (2005). The Role of Quantifier Alternations in Cut Elimination. Notre Dame Journal of Formal Logic 46 (2):165-171.score: 24.0
    Extending previous results from work on the complexity of cut elimination for the sequent calculus LK, we discuss the role of quantifier alternations and develop a measure to describe the complexity of cut elimination in terms of quantifier alternations in cut formulas and contractions on such formulas.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. Seahwa Kim (2012). Modal Tense and the Absolutely Unrestricted Quantifier. Acta Analytica 27 (1):73-76.score: 22.0
    In this paper, I examine Takashi Yagisawa’s response to van Inwagen’s ontic objection against David Lewis. Van Inwagen criticizes Lewis’s commitment to the absolutely unrestricted sense of ‘there is,’ and Yagisawa claims that by adopting modal tenses he avoids commitment to absolutely unrestricted quantification. I argue that Yagisawa faces a problem parallel to the one Lewis faces. Although Yagisawa officially rejects the absolutely unrestricted sense of a quantifying expression, he is still committed to the absolutely unrestricted sense of ‘is a (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  12. Rafael Grimson, Bart Kuijpers & Walied Othman (2012). Quantifier Elimination for Elementary Geometry and Elementary Affine Geometry. Mathematical Logic Quarterly 58 (6):399-416.score: 21.0
    No categories
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  13. Shawn Hedman & Wai Yan Pong (2011). Quantifier-Eliminable Locally Finite Graphs. Mathematical Logic Quarterly 57 (2):180-185.score: 21.0
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  14. M. Prunescu (2001). Non-Effective Quantifier Elimination. Mathematical Logic Quarterly 47 (4):557-562.score: 21.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  15. Stefano Baratella & Siu‐Ah Ng (2003). Consequences of Neocompact Quantifier Elimination. Mathematical Logic Quarterly 49 (2):150-162.score: 21.0
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  16. Samuel R. Buss & Alan S. Johnson (2010). The Quantifier Complexity of Polynomial‐Size Iterated Definitions in First‐Order Logic. Mathematical Logic Quarterly 56 (6):573-590.score: 21.0
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  17. G. Aldo Antonelli (2010). Numerical Abstraction Via the Frege Quantifier. Notre Dame Journal of Formal Logic 51 (2):161-179.score: 20.0
    This paper presents a formalization of first-order arithmetic characterizing the natural numbers as abstracta of the equinumerosity relation. The formalization turns on the interaction of a nonstandard (but still first-order) cardinality quantifier with an abstraction operator assigning objects to predicates. The project draws its philosophical motivation from a nonreductionist conception of logicism, a deflationary view of abstraction, and an approach to formal arithmetic that emphasizes the cardinal properties of the natural numbers over the structural ones.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  18. Robin Clark & Murray Grossman (2007). Number Sense and Quantifier Interpretation. Topoi 26 (1):51--62.score: 20.0
    We consider connections between number sense—the ability to judge number—and the interpretation of natural language quantifiers. In particular, we present empirical evidence concerning the neuroanatomical underpinnings of number sense and quantifier interpretation. We show, further, that impairment of number sense in patients can result in the impairment of the ability to interpret sentences containing quantifiers. This result demonstrates that number sense supports some aspects of the language faculty.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  19. Jakub Szymanik & Marcin Zajenkowski (2009). Improving Methodology of Quantifier Comprehension Experiments. Neuropsychologia 47 (12):2682--2683.score: 20.0
    Szymanik (2007) suggested that the distinction between first-order and higher-order quantifiers does not coincide with the computational resources required to compute the meaning of quantifiers. Cognitive difficulty of quantifier processing might be better assessed on the basis of complexity of the minimal corresponding automata. For example, both logical and numerical quantifiers are first-order. However, computational devices recognizing logical quantifiers have a fixed number of states while the number of states in automata corresponding to numerical quantifiers grows with the rank (...)
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  20. Franco Montagna (2012). Δ-Core Fuzzy Logics with Propositional Quantifiers, Quantifier Elimination and Uniform Craig Interpolation. Studia Logica 100 (1-2):289-317.score: 20.0
    In this paper we investigate the connections between quantifier elimination, decidability and Uniform Craig Interpolation in Δ-core fuzzy logics added with propositional quantifiers. As a consequence, we are able to prove that several propositional fuzzy logics have a conservative extension which is a Δ-core fuzzy logic and has Uniform Craig Interpolation.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  21. Graham Priest (2008). The Closing of the Mind: How the Particular Quantifier Became Existentially Loaded Behind Our Backs. Review of Symbolic Logic 1 (1):42-55.score: 18.0
    The paper argues that the view that the particular quantifier is is a relatively new one historically and that it has become entrenched in modern philosophical logic for less than happy reasons.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  22. Eli Hirsch (2010). Quantifier Variance and Realism: Essays in Metaontology. Oxford University Press.score: 18.0
    A sense of unity -- Basic objects : a reply to Xu -- Objectivity without objects -- The vagueness of identity -- Quantifier variance and realism -- Against revisionary ontology -- Comments on Theodore Sider's four dimensionalism -- Sosa's existential relativism -- Physical-object ontology, verbal disputes, and common sense -- Ontological arguments : interpretive charity and quantifier variance -- Language, ontology, and structure -- Ontology and alternative languages.
    Direct download  
     
    My bibliography  
     
    Export citation  
  23. Theodore Sider (2007). Neo-Fregeanism and Quantifier Variance. Aristotelian Society Supplementary Volume 81 (1):201–232.score: 18.0
    NeoFregeanism is an intriguing but elusive philosophy of mathematical existence. At crucial points, it goes cryptic and metaphorical. I want to put forward an interpretation of neoFregeanism—perhaps not one that actual neoFregeans will embrace—that makes sense of much of what they say. NeoFregeans should embrace quantifier variance.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  24. Samir Okasha (2005). Does Hume's Argument Against Induction Rest on a Quantifier-Shift Fallacy? Proceedings of the Aristotelian Society 105 (2):253–271.score: 18.0
    It is widely agreed that Hume's description of human inductive reasoning is inadequate. But many philosophers think that this inadequacy in no way affects the force of Hume's argument for the unjustifiability of inductive reasoning. I argue that this constellation of opinions contains a serious tension, given that Hume was not merely pointing out that induction is fallible. I then explore a recent diagnosis of where Hume's sceptical argument goes wrong, due to Elliott Sober. Sober argues that Hume committed a (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  25. Katherine Hawley (2007). Neo‐Fregeanism and Quantifier Variance. Aristotelian Society Supplementary Volume 81 (1):233 - 249.score: 18.0
    Sider argues that, of maximalism and quantifier variance, the latter promises to let us make better sense of neo-Fregeanism. I argue that neo-Fregeans should, and seemingly do, reject quantifier variance. If they must choose between these two options, they should choose maximalism.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  26. Friederike Moltmann (2006). Presuppositions and Quantifier Domains. Synthese 149 (1):179 - 224.score: 18.0
    In this paper, I will argue for a new account of presuppositions which is based on double indexing as well as minimal representational contexts providing antecedent material for anaphoric presuppositions, rather than notions of context defined in terms of the interlocutors’ pragmatic presuppositions or the information accumulated from the preceding discourse. This account applies in particular to new phenomena concerning the presupposition of quantifier domains. But it is also intended to be an account of presuppositions in general. The account (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  27. Theodore Hailperin (2000). Probability Semantics for Quantifier Logic. Journal of Philosophical Logic 29 (2):207-239.score: 18.0
    By supplying propositional calculus with a probability semantics we showed, in our 1996, that finite stochastic problems can be treated by logic-theoretic means equally as well as by the usual set-theoretic ones. In the present paper we continue the investigation to further the use of logical notions in probability theory. It is shown that quantifier logic, when supplied with a probability semantics, is capable of treating stochastic problems involving countably many trials.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  28. Adrian Brasoveanu, Structured Anaphora to Quantifier Domains: A Unified Account of Quantificational and Modal Subordination.score: 18.0
    The paper proposes an account of the contrast (noticed in Karttunen 1976) between the interpretations of the following two discourses: Harvey courts a girl at every convention. {She is very pretty. vs. She always comes to the banquet with him.}. The initial sentence is ambiguous between two quantifier scopings, but the first discourse as a whole allows only for the wide-scope indefinite reading, while the second allows for both. This cross-sentential interaction between quantifier scope and anaphora is captured (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  29. M. Abad, J. P. Díaz Varela, L. A. Rueda & A. M. Suardíaz (2000). Varieties of Three-Valued Heyting Algebras with a Quantifier. Studia Logica 65 (2):181-198.score: 18.0
    This paper is devoted to the study of some subvarieties of the variety Qof Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Qis far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q 3 and we construct the lattice of (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  30. Adrian Brasoveanu, Structured Anaphora to Quantifier Domains: A Unified Account of Quantificational & Modal Subordination and Exceptional Wide Scope.score: 18.0
    The paper proposes a novel analysis of quantificational subordination, e.g. Harvey courts a woman at every convention. {She is very pretty. vs. She always comes to the banquet with him.} (Karttunen 1976), in particular of the fact that the indefinite in the initial sentence can have wide or narrow scope, but the first discourse as a whole allows only for the wide scope reading, while the second discourse allows for both readings. The cross-sentential interaction between scope and anaphora is captured (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
  31. Dov M. Gabbay & Andrzej Szałas (2007). Second-Order Quantifier Elimination in Higher-Order Contexts with Applications to the Semantical Analysis of Conditionals. Studia Logica 87 (1):37 - 50.score: 18.0
    Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially using a (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  32. Natasha Alechina (1995). On a Decidable Generalized Quantifier Logic Corresponding to a Decidable Fragment of First-Order Logic. Journal of Logic, Language and Information 4 (3):177-189.score: 18.0
    Van Lambalgen (1990) proposed a translation from a language containing a generalized quantifierQ into a first-order language enriched with a family of predicatesR i, for every arityi (or an infinitary predicateR) which takesQxg(x, y1,..., yn) to x(R(x, y1,..., y1) (x,y1,...,yn)) (y 1,...,yn are precisely the free variables ofQx). The logic ofQ (without ordinary quantifiers) corresponds therefore to the fragment of first-order logic which contains only specially restricted quantification. We prove that it is decidable using the method of analytic tableaux. Related (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  33. Ernest Pore & James Garson (1983). Pronouns and Quantifier-Scope in English. Journal of Philosophical Logic 12 (3):327 - 358.score: 18.0
    This paper is truly a joint effort and it could not have been written without the contribution of both authors. Garson, though, deserves credit (or blame) for first seeing the need for two kinds of quantifier scope, and also for devising essentials of the positive theory.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  34. Konrad Zdanowski (2009). On Second Order Intuitionistic Propositional Logic Without a Universal Quantifier. Journal of Symbolic Logic 74 (1):157-167.score: 18.0
    We examine second order intuitionistic propositional logic, IPC². Let $F_\exists $ be the set of formulas with no universal quantification. We prove Glivenko's theorem for formulas in $F_\exists $ that is, for φ € $F_\exists $ φ is a classical tautology if and only if ¬¬φ is a tautology of IPC². We show that for each sentence φ € $F_\exists $ (without free variables), φ is a classical tautology if and only if φ is an intuitionistic tautology. As a corollary (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  35. Sjaak de Mey (1991). 'Only' as a Determiner and as a Generalized Quantifier. Journal of Semantics 8 (1-2):91-106.score: 18.0
    Two types of linguistic theories have been particularly concerned with the analysis of ‘only’: pragmatics, in particular focus theory and presupposition theory, and generalized quantifier (GQ) theory, the latter in the negative sense that it has been eager to show that ‘only’ is not a GQ. Judging from such analyses, then, it would appear that the analysis of ‘only’ is not at home in the grammar of natural language. The main negative point of the present article is to dispute (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  36. Žarko Mijajlović (1985). On the Definability of the Quantifier “There Exist Uncountably Many”. Studia Logica 44 (3):257 - 264.score: 18.0
    In paper [5] it was shown that a great part of model theory of logic with the generalized quantifier Q x = there exist uncountably many x is reducible to the model theory of first order logic with an extra binary relation symbol. In this paper we consider when the quantifier Q x can be syntactically defined in a first order theory T. That problem was raised by Kosta Doen when he asked if the quantifier Q x (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  37. Luc Bélair & Françoise Point (2010). Quantifier Elimination in Valued Ore Modules. Journal of Symbolic Logic 75 (3):1007-1034.score: 18.0
    We consider valued fields with a distinguished isometry or contractive derivation as valued modules over the Ore ring of difference operators. Under certain assumptions on the residue field, we prove quantifier elimination first in the pure module language, then in that language augmented with a chain of additive subgroups, and finally in a two-sorted language with a valuation map. We apply quantifier elimination to prove that these structures do not have the independence property.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  38. Harvey Friedman, Three Quantifier Sentences.score: 18.0
    We give a complete proof that all 3 quantifier sentences in the primitive notation of set theory (Œ,=), are decided in ZFC, and in fact in a weak fragment of ZF without the power set axiom. We obtain information concerning witnesses of 2 quantifier formulas with one free variable. There is a 5 quantifier sentence that is not decided in ZFC (see [Fr02]).
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  39. István Németi (1991). Algebraization of Quantifier Logics, an Introductory Overview. Studia Logica 50 (3-4):485 - 569.score: 18.0
    This paper is an introduction: in particular, to algebras of relations of various ranks, and in general, to the part of algebraic logic algebraizing quantifier logics. The paper has a survey character, too. The most frequently used algebras like cylindric-, relation-, polyadic-, and quasi-polyadic algebras are carefully introduced and intuitively explained for the nonspecialist. Their variants, connections with logic, abstract model theory, and further algebraic logics are also reviewed. Efforts were made to make the review part relatively comprehensive. In (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  40. Victor Pambuccian (2002). Axiomatizations of Hyperbolic Geometry: A Comparison Based on Language and Quantifier Type Complexity. Synthese 133 (3):331 - 341.score: 18.0
    Hyperbolic geometry can be axiomatized using the notions of order andcongruence (as in Euclidean geometry) or using the notion of incidencealone (as in projective geometry). Although the incidence-based axiomatizationmay be considered simpler because it uses the single binary point-linerelation of incidence as a primitive notion, we show that it issyntactically more complex. The incidence-based formulation requires some axioms of the quantifier-type forallexistsforall, while the axiom system based on congruence and order can beformulated using only forallexists-axioms.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  41. Jarmo Kontinen (2013). Coherence and Computational Complexity of Quantifier-Free Dependence Logic Formulas. Studia Logica 101 (2):267-291.score: 18.0
    We study the computational complexity of the model checking problem for quantifier-free dependence logic ${(\mathcal{D})}$ formulas. We characterize three thresholds in the complexity: logarithmic space (LOGSPACE), non-deterministic logarithmic space (NL) and non-deterministic polynomial time (NP).
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  42. Walid S. Saba & Jean-Pierre Corriveau (2001). Plausible Reasoning and the Resolution of Quantifier Scope Ambiguities. Studia Logica 67 (2):271-289.score: 18.0
    Despite overwhelming evidence suggesting that quantifier scope is a phenomenon that must be treated at the pragmatic level, most computational treatments of scope ambiguities have thus far been a collection of syntactically motivated preference rules. This might be in part due to the prevailing wisdom that a commonsense inferencing strategy would require the storage of and reasoning with a vast amount of background knowledge. In this paper we hope to demonstrate that the challenge in developing a commonsense inferencing strategy (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  43. Klaus Ambos-Spies, Peter A. Fejer, Steffen Lempp & Manuel Lerman (1996). Decidability of the Two-Quantifier Theory of the Recursively Enumerable Weak Truth-Table Degrees and Other Distributive Upper Semi-Lattices. Journal of Symbolic Logic 61 (3):880-905.score: 18.0
    We give a decision procedure for the ∀∃-theory of the weak truth-table (wtt) degrees of the recursively enumerable sets. The key to this decision procedure is a characterization of the finite lattices which can be embedded into the r.e. wtt-degrees by a map which preserves the least and greatest elements: a finite lattice has such an embedding if and only if it is distributive and the ideal generated by its cappable elements and the filter generated by its cuppable elements are (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  44. G. Politzer (2007). The Psychological Reality of Classical Quantifier Entailment Properties. Journal of Semantics 24 (4):331-343.score: 18.0
    A test of directional entailment properties of classical quantifiers defined by the theory of generalized quantifiers (Barwise & Cooper 1981) is described. Participants had to solve a task which consisted of four kinds of inference. In the first one, the premise was of the form ‘Q–hyponym–verb–blank predicate’, where Q is a classical quantifier (e.g. ‘Some cats are [ ]’), and the question was to indicate what, if anything, can be concluded by filling the slots in ‘...–hyperonym–verb–blank predicate’ (e.g. ‘... (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  45. Maxwell J. Roberts, Stephen E. Newstead & Richard A. Griggs (2001). Quantifier Interpretation and Syllogistic Reasoning. Thinking and Reasoning 7 (2):173 – 204.score: 18.0
    Many researchers have suggested that premise interpretation errors can account, at least in part, for errors on categorical syllogisms. However, although it is possible to show that people make such errors in simple inference tasks, the evidence for them is far less clear when actual syllogisms are administered. Part of the problem is due to the lack of clear predictions for the solutions that would be expected when using modified quantifiers, assuming that correct inferences are made from them. This paper (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  46. Theodore Hailperin (2007). Quantifier Probability Logic and the Confirmation Paradox. History and Philosophy of Logic 28 (1):83-100.score: 18.0
    Exhumation and study of the 1945 paradox of confirmation brings out the defect of its formulation. In the context of quantifier conditional-probability logic it is shown that a repair can be accomplished if the truth-functional conditional used in the statement of the paradox is replaced with a connective that is appropriate to the probabilistic context. Description of the quantifier probability logic involved in the resolution of the paradox is presented in stages. Careful distinction is maintained between a formal (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  47. Ítala M. L. D'Ottaviano (1987). Definability and Quantifier Elimination for J3-Theories. Studia Logica 46 (1):37 - 54.score: 18.0
    The Joint Non-Trivialization Theorem, two Definability Theorems and the generalized Quantifier Elimination Theorem are proved for J 3-theories. These theories are three-valued with more than one distinguished truth-value, reflect certain aspects of model type logics and can. be paraconsistent. J 3-theories were introduced in the author's doctoral dissertation.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  48. Anastasia Giannakidou, Definiteness, Contextual Domain Restriction, and Quantifier Structure: A Crosslinguistic Perspective.score: 18.0
    In this paper, we present a theory of interaction between definiteness and quantifier structure, where the definite determiner (D) performs the function of contextually restricting the domain of quantificational determiners (Qs). Our motivating data come from Greek and Basque, where D appears to compose with the Q itself. Similar compositions are found in Hungarian and Bulgarian. Following earlier work (Giannakidou 2004, Etxeberria 2005, Etxeberria and Giannakidou 2009) we define a domain restricting function DDR, in which D modifies the Q (...)
    No categories
    Translate to English
    |
     
    My bibliography  
     
    Export citation  
  49. Manuel Abad, J. P. Diaz Varela & L. A. Rueda (2000). Varieties of Three-Values Heyting Algebras with a Quantifier. Studia Logica 65 (2):181-198.score: 18.0
    This paper is devoted to the study of some subvarieties of the variety Q of Q-Heyting algebras, that is, Heyting algebras with a quantifier. In particular, a deeper investigation is carried out in the variety Q subscript 3 of three-valued Q-Heyting algebras to show that the structure of the lattice of subvarieties of Q is far more complicated that the lattice of subvarieties of Heyting algebras. We determine the simple and subdirectly irreducible algebras in Q subscript 3 and we (...)
    Direct download  
     
    My bibliography  
     
    Export citation  
1 — 50 / 1000