Log in

Relevant bibliographies by topics / Quantifier alternation / Journal articles

To see the other types of publications on this topic, follow the link: Quantifier alternation.

Journal articles on the topic 'Quantifier alternation'

Author: Grafiati

Published: 4 June 2021

Last updated: 19 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Quantifier alternation.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Benmamoun, Elabbas. "The Syntax of Quantifiers and Quantifier Float." Linguistic Inquiry 30, no. 4 (October 1999): 621–42. http://dx.doi.org/10.1162/002438999554237.

Full text

Abstract:

The Arabic quantifier kull displays a Q___NP and NP___Q alternation. Shlonsky (1991) argues that in both patterns Q heads a QP projection with the NP as a complement that may undergo movement to [Spec, QP] or beyond to yield the NP___Q pattern and Q-float structures. On the contrary, I argue on the basis of evidence from reconstruction, Case, and agreement that the two patterns are radically different. In the Q___NP pattern Q is indeed the head of a QP projection that contains the NP. In the NP___Q pattern, however, Q heads a QP adjunct that modifies the NP and in some cases the VP.

APA, Harvard, Vancouver, ISO, and other styles

2

Huumo, Tuomas. "Layers of (un)boundedness: The aspectual–quantificational interplay of quantifiers and partitive case in Finnish object arguments." Linguistics 58, no. 3 (May 26, 2020): 905–36. http://dx.doi.org/10.1515/ling-2020-0084.

Full text

Abstract:

AbstractI present an account of the interplay between quantifiers and the partitive–accusative case alternation in Finnish object marking, with special reference to the aspectual and quantificational semantics of the clause. The case alternation expresses two oppositions (in affirmative clauses): (a) bounded (accusative) vs. unbounded (partitive) quantity, (b) culminating (accusative) vs. non-culminating (partitive) aspect. The quantifiers analyzed are of two main types: (i) mass quantifiers (e. g., paljon ‘a lot of’, vähän ‘(a) little’), which quantify a mass expressed by a mass noun or a plural form, (ii) number quantifiers (e. g., moni ‘many’, usea ‘a number of’), which quantify a multiplicity of discrete entities expressed by a count noun in the singular or plural. Finnish mass quantifiers only quantify nominals in the partitive, while number quantifiers agree with the quantified nominal in number and case and are used throughout the case paradigm. With a mass quantifier, the partitive form of the quantified nominal expresses unbounded quantity, which the quantifier then renders bounded (quantized). This is why object phrases with mass quantifiers behave like accusative objects: they express a bounded quantity together with culminating aspect. Number quantifiers quantify both accusative and partitive objects, in the singular and plural. Such objects are able to express aspect and quantity at two levels: (i) that of the individual component events which concern one entity each; (ii) that of the higher-order event which concerns the whole quantity expressed. I argue that the case marking of the object relates primarily to level (i), while the meaning of the number quantifier relates to level (ii). This is why a number quantifier typically renders the quantity bounded and the aspect culminating at level (ii), even when the partitive case expresses unboundedness or lack of culmination at level (i).

APA, Harvard, Vancouver, ISO, and other styles

3

Pikhurko, Oleg, Joel Spencer, and Oleg Verbitsky. "Decomposable graphs and definitions with no quantifier alternation." European Journal of Combinatorics 28, no. 8 (November 2007): 2264–83. http://dx.doi.org/10.1016/j.ejc.2007.04.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Zhukovskii, M. E. "Quantifier Alternation in First-Order Formulas with Infinite Spectra." Problems of Information Transmission 53, no. 4 (April 15, 2017): 391–403. http://dx.doi.org/10.1134/s003294601704007x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Matz, Oliver, Nicole Schweikardt, and Wolfgang Thomas. "The Monadic Quantifier Alternation Hierarchy over Grids and Graphs." Information and Computation 179, no. 2 (December 2002): 356–83. http://dx.doi.org/10.1006/inco.2002.2955.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Kufleitner, Manfred, and Tobias Walter. "Level Two of the Quantifier Alternation Hierarchy Over Infinite Words." Theory of Computing Systems 62, no. 3 (August 4, 2017): 467–80. http://dx.doi.org/10.1007/s00224-017-9801-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Kufleitner, Manfred, and Tobias Walter. "One quantifier alternation in first-order logic with modular predicates." RAIRO - Theoretical Informatics and Applications 49, no. 1 (January 2015): 1–22. http://dx.doi.org/10.1051/ita/2014024.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Place, Thomas, and Marc Zeitoun. "Going Higher in First-Order Quantifier Alternation Hierarchies on Words." Journal of the ACM 66, no. 2 (April 26, 2019): 1–65. http://dx.doi.org/10.1145/3303991.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Pikhurko, Oleg, and Oleg Verbitsky. "Descriptive complexity of finite structures: Saving the quantifier rank." Journal of Symbolic Logic 70, no. 2 (June 2005): 419–50. http://dx.doi.org/10.2178/jsl/1120224721.

Full text

Abstract:

AbstractWe say that a first order formula Φ distinguishes a structure M over a vocabulary L from another structure M′ over the same vocabulary if Φ is true on M but false on M′. A formula Φ defines an L-structure M if Φ distinguishes M from any other non-isomorphic L-structure M′. A formula Φ identifies an n-element L-structure M if Φ distinguishes M from any other non-isomorphic n-element L-structure M′.We prove that every n-element structure M is identifiable by a formula with quantifier rank less than and at most one quantifier alternation, where k is the maximum relation arity of M. Moreover, if the automorphism group of M contains no transposition of two elements, the same result holds for definability rather than identification.The Bernays-Schönfinkel class consists of prenex formulas in which the existential quantifiers all precede the universal quantifiers. We prove that every n-element structure M is identifiable by a formula in the Bernays-Schönfinkel class with less than quantifiers. If in this class of identifying formulas we restrict the number of universal quantifiers to k, then less than quantifiers suffice to identify M and. as long as we keep the number of universal quantifiers bounded by a constant, at total quantifiers are necessary.

APA, Harvard, Vancouver, ISO, and other styles

10

Keisler, H. Jerome, and Wafik Boulos Lotfallah. "First order quantifiers in monadic second order logic." Journal of Symbolic Logic 69, no. 1 (March 2004): 118–36. http://dx.doi.org/10.2178/jsl/1080938831.

Full text

Abstract:

AbstractThis paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01].We introduce an operation existsn (S) on properties S that says “there are n components having S”. We use this operation to show that under natural strictness conditions, adding a first order quantifier word u to the beginning of a prefix class V increases the expressive power monotonically in u. As a corollary, if the first order quantifiers are not already absorbed in V, then both the quantifier alternation hierarchy and the existential quantifier hierarchy in the positive first order closure of V are strict.We generalize and simplify methods from Marcinkowski [Mar99] to uncover limitations of the expressive power of an additional first order quantifier, and show that for a wide class of properties S, S cannot belong to the positive first order closure of a monadic prefix class W unless it already belongs to W.We introduce another operation alt(S) on properties which has the same relationship with the Circuit Value Problem as reach(S) (defined in [JM01]) has with the Directed Reachability Problem. We use alt(S) to show that Πn ⊈ FO(Σn), Σn ⊈ FO(∆n). and ∆n+1 ⊈ FOB(Σn), solving some open problems raised in [Mat98].

APA, Harvard, Vancouver, ISO, and other styles

11

Matz, Oliver. "Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures." Theoretical Computer Science 270, no. 1-2 (January 2002): 1–70. http://dx.doi.org/10.1016/s0304-3975(01)00277-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Place, Thomas, and Marc Zeitoun. "The tale of the quantifier alternation hierarchy of first-order logic over words." ACM SIGLOG News 2, no. 3 (August 17, 2015): 4–17. http://dx.doi.org/10.1145/2815493.2815495.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Gan, Tian, and Cheng-Yu Edwin Tsai. "The syntax of Mandarin dative alternation." International Journal of Chinese Linguistics 7, no. 2 (December 10, 2020): 187–222. http://dx.doi.org/10.1075/ijchl.20006.gan.

Full text

Abstract:

Abstract This paper investigates the syntax of dative constructions (DCs) in Mandarin from the perspective of quantifier scope interpretation. In the literature, doubly quantified DCs such as Xiaoming ji-le yi-zhang mingxinpian gei mei-yi-wei laoshi ‘Xiaoming mailed one postcard to every teacher’ have been claimed to be scopally ambiguous, and different syntactic analyses have been proposed based on this observation. Crucially, however, DCs with the universal direct object (DO) preceding the existential indirect object (IO), e.g., Xiaoming ji-le mei-yi-zhang mingxinpian gei yi-wei laoshi ‘Xiaoming mailed every postcard to one teacher’, appear to be not ambiguous, where only the existential IO seems to take wide scope. This problem, which we call the dative puzzle, has not been systematically explored, either theoretically or experimentally. To fill this gap, we conducted an experiment on the scope interpretation of dative sentences in Mandarin, which confirms the above observation. A syntactic analysis for Mandarin DCs is proposed accordingly, where it is argued that (i) DCs share the same underlying structure with shift constructions (SCs) of the form [Subj V-gei IO DO], both containing a causative vP embedded under an action verb (cf. Cheng et al. 1999); (ii) the surface form of a DC is derived by an optional, vP-internal scrambling of the DO from the lowest complement position to an adjunct position; and (iii) such scrambling does not affect scope interpretation. Our proposal suggests that, insofar as inherently ditransitive verbs are concerned, Mandarin DCs and SCs are derivationally related, and the observed dative puzzle is shown to follow from the structural hierarchy of the advocated base syntax of DCs.

APA, Harvard, Vancouver, ISO, and other styles

14

Oku, Satoshi. "Inverse scope and unaccusativity alternation." Proceedings of the Linguistic Society of America 3, no. 1 (March 3, 2018): 10. http://dx.doi.org/10.3765/plsa.v3i1.4305.

Full text

Abstract:

In this paper, I first review evidence for the claim that there is an inverse correlation between Japanese scrambling and QR: that is, Japanese is scope rigid because it allows scrambling as a syntactic option (Szabolcsi 1997, Bobaljik and Wurmbrand 2012). According to Bobaljik and Wurmbrand’s approach, QR is blocked in Japanese because Japanese has scrambling. There are, however, cases in which apparent inverse scope is easily available in Japanese (Oku 2010), which is problematic to Bobaljik and Wurmbrand and to any theoretical attempt to account for Szabolcsi’s inverse correlation. To explain this conflicting situation, I will propose that verbs involved in such apparent counterexamples are actually unaccusatives so that the surface subject is the underlying complement of the verb: the apparent inverse scope is read off at the underlying structure where the surface subject is c-commanded by the PP. As independent evidence for the unaccusasivity of the verbs in question, I will show that the floating quantifier fact (Miyagawa 1989) confirms what I propose. Further, the unaccusativity alternation in Japanese (reported by Yamada 1998) is endorsed by the inverse scope facts explored in this paper.

APA, Harvard, Vancouver, ISO, and other styles

15

Verveckken, Katrien, and Bert Cornillie. "Un análisis cognitivo-funcional de la concordancia verbal con construcciones (pseudo)partitivas del tipo [N1 + de + N2]." Revue Romane / Langue et littérature. International Journal of Romance Languages and Literatures 47, no. 2 (November 30, 2012): 219–57. http://dx.doi.org/10.1075/rro.47.2.02ver.

Full text

Abstract:

In this paper we present a corpus-based, cognitive-linguistic account of the singular/plural agreement alternation with binominal constructions belonging to the [N1singular + de + N2plural]-type. From a syntagmatic point of view, plural agreement reflects a shift from N1 as the head of the Noun Phrase towards N1 being a quantifier to N2. This view is in line with grammaticalization theory and holds for many examples, yet there are important counterexamples where we find a singular verb despite N1 being used as a quantifier. The Hispanic linguistic literature mentions several factors that would favor plural agreement with N2 such as an indefinite article, the distance between the verb and the subject, the position of the subject and pseudopartitive rather than partitive use. The corpus analysis will show that these factors are not conclusive. Our alternative account has recourse to the concept of lexical persistence and shows to what extent the quantifier use of N1 retains semantic features associated with the head use of N1. We argue that verbal agreement phenomena can be motivated by the interaction between lexical persistence and the morpho-syntactic and semantic criteria listed in literature. Lexical persistence is thus not a side effect of the grammaticalization process, but a crucial dimension of binominal constructions in that it allows us to explain quantifier uses of N1 with a singular verb.

APA, Harvard, Vancouver, ISO, and other styles

16

KUFLEITNER, MANFRED, and ALEXANDER LAUSER. "AROUND DOT-DEPTH ONE." International Journal of Foundations of Computer Science 23, no. 06 (September 2012): 1323–39. http://dx.doi.org/10.1142/s0129054112400552.

Full text

Abstract:

The dot-depth hierarchy is a classification of star-free languages. It is related to the quantifier alternation hierarchy of first-order logic over finite words. We consider subclasses of languages with dot-depth 1/2 and dot-depth 1 obtained by prohibiting the specification of prefixes or suffixes. As it turns out, these language classes are in one-to-one correspondence with fragments of alternation-free first-order logic without min- or max-predicate, respectively. For all fragments, we obtain effective algebraic characterizations. Moreover, we give new proofs for the decidability of the membership problem for dot-depth 1/2 and dot-depth 1.

APA, Harvard, Vancouver, ISO, and other styles

17

CARTON, OLIVIER, THOMAS COLCOMBET, and GABRIELE PUPPIS. "AN ALGEBRAIC APPROACH TO MSO-DEFINABILITY ON COUNTABLE LINEAR ORDERINGS." Journal of Symbolic Logic 83, no. 3 (September 2018): 1147–89. http://dx.doi.org/10.1017/jsl.2018.7.

Full text

Abstract:

AbstractWe develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three logical applications. First, we establish the first known collapse result for the quantifier alternation of MSO logic over countable linear orderings. Second, we solve an open problem posed by Gurevich and Rabinovich, concerning the MSO-definability of sets of rational numbers using the reals in the background. Third, we establish the MSO-definability of the set of yields induced by an MSO-definable set of trees, confirming a conjecture posed by Bruyère, Carton, and Sénizergues.

APA, Harvard, Vancouver, ISO, and other styles

18

Das, Anupam. "From QBFs to MALL and Back via Focussing." Journal of Automated Reasoning 64, no. 7 (May 22, 2020): 1221–45. http://dx.doi.org/10.1007/s10817-020-09564-x.

Full text

Abstract:

Abstract In this work we investigate how to extract alternating time bounds from ‘focussed’ proof systems. Our main result is the obtention of fragments of $$\mathsf {MALL} {\mathsf {w} }$$ MALL w ($$\mathsf {MALL} $$ MALL with weakening) complete for each level of the polynomial hierarchy. In one direction we encode QBF satisfiability and in the other we encode focussed proof search, and we show that the composition of the two encodings preserves quantifier alternation, yielding the required result. By carefully composing with well-known embeddings of $$\mathsf {MALL} {\mathsf {w} }$$ MALL w into $$\mathsf {MALL} $$ MALL , we obtain a similar delineation of $$\mathsf {MALL} $$ MALL formulas, again carving out fragments complete for each level of the polynomial hierarchy. This refines the well-known results that both $$\mathsf {MALL} {\mathsf {w} }$$ MALL w and $$\mathsf {MALL} $$ MALL are $$\mathbf {PSPACE}$$ PSPACE -complete. A key insight is that we have to refine the usual presentation of focussing to account for deterministic computations in proof search, which correspond to invertible rules that do not branch. This is so that we may more faithfully associate phases of focussed proof search to their alternating time complexity. This presentation seems to uncover further dualities, at the level of proof search, than usual presentations, so could be of proof theoretic interest in its own right.

APA, Harvard, Vancouver, ISO, and other styles

19

Szymanik, Jakub, and Marcin Zajenkowski. "Contribution of working memory in parity and proportional judgments." Cognitive and Empirical Pragmatics 25 (December 5, 2011): 176–94. http://dx.doi.org/10.1075/bjl.25.08szy.

Full text

Abstract:

This paper presents experimental evidence on the differences in a sentence–picture verification task under additional memory load between parity and proportional quantifiers. We asked subjects to memorize strings of four or six digits, then to decide whether a quantified sentence was true for a given picture, and finally to recall the initially given string of numbers. The results show that: (a) proportional quantifiers are more difficult than parity quantifiers with respect to reaction time and accuracy; (b) maintaining either four or six elements in working memory has the same effect on the processing of parity quantifiers; (c) however, in the case of proportional quantifiers subjects perform better in the verification tasks under the six-digit load condition, and (d) even though the strings of four numbers were better recalled by subjects after judging parity there is no difference between quantifiers in the case of the six-element condition. We briefly outline two alternative explanations for the observed phenomena rooted in the computational model of quantifier verification and the different theories of working memory.

APA, Harvard, Vancouver, ISO, and other styles

20

Oger, Francis. "Elementary equivalence for abelian-by-finite and nilpotent groups." Journal of Symbolic Logic 66, no. 3 (September 2001): 1471–80. http://dx.doi.org/10.2307/2695119.

Full text

Abstract:

AbstractWe show that two abelian-by-finite groups are elementarily equivalent if and only if they satisfy the same sentences with two alternations of quantifiers. We also prove that abelian-by-finite groups satisfy a quantifier elimination property. On the other hand, for each integer n, we give some examples of nilpotent groups which satisfy the same sentences with n alternations of quantifiers and do not satisfy the same sentences with n + 1 alternations of quantifiers.

APA, Harvard, Vancouver, ISO, and other styles

21

Koeva, Svetla. "Verb aspect, alternations and quantification." Cognitive Studies | Études cognitives, no. 11 (November 24, 2015): 125–34. http://dx.doi.org/10.11649/cs.2011.007.

Full text

Abstract:

Verb aspect, alternations and quantificationIn this paper we are briefly discuss the nature of Bulgarian verb aspect and argue that the verb aspect pairs are different lexical units with different (although related) meaning, different argument structure (reflecting categories, explicitness and referential status of arguments) and different sets of semantic and syntactic alternations. The verb prefixes resulting in perfective verbs derivation in some cases can be interpreted as lexical quantifiers as well. Thus the Bulgarian verb aspect is related (in different way) both with the potential for the generation of alternations and with the prefixal lexical quantification. It is shown that the scope of the lexical quantification by means of verbal prefixes is the quantified verb phrase and the scope remains constant in all derived alternations. The paper concerns the basic issues of these complex problems, while the detailed description of the conditions satisfying particular alternation or particular lexical quantification are subject of a more detailed study.

APA, Harvard, Vancouver, ISO, and other styles

22

Gerhardy, Philipp. "The Role of Quantifier Alternations in Cut Elimination." Notre Dame Journal of Formal Logic 46, no. 2 (April 2005): 165–71. http://dx.doi.org/10.1305/ndjfl/1117755147.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Bournez, Olivier, Felipe Cucker, Paulin Jacobé de Naurois, and Jean-Yves Marion. "Implicit complexity over an arbitrary structure: Quantifier alternations." Information and Computation 204, no. 2 (February 2006): 210–30. http://dx.doi.org/10.1016/j.ic.2005.07.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Creignou, N., H. Daude, and U. Egly. "Phase Transition for Random Quantified XOR-Formulas." Journal of Artificial Intelligence Research 29 (May 10, 2007): 1–18. http://dx.doi.org/10.1613/jair.2120.

Full text

Abstract:

The QXORSAT problem is the quantified version of the satisfiability problem XORSAT in which the connective exclusive-or is used instead of the usual or. We study the phase transition associated with random QXORSAT instances. We give a description of this phase transition in the case of one alternation of quantifiers, thus performing an advanced practical and theoretical study on the phase transition of a quantified roblem.

APA, Harvard, Vancouver, ISO, and other styles

25

DANON, GABI. "Agreement alternations with quantified nominals in Modern Hebrew." Journal of Linguistics 49, no. 1 (October 8, 2012): 55–92. http://dx.doi.org/10.1017/s0022226712000333.

Full text

Abstract:

Cross-linguistically, quantified noun phrases (QNPs) trigger one of four agreement patterns: with the quantifier, with the noun, default agreement, or semantic agreement. This paper focuses on agreement alternations in Hebrew, and argues that they follow not from variations in hierarchical structure but from the availability of multiple means of assigning values to the QNP's features. Building upon the index-concord analysis of Wechsler & Zlatić (2003) and adapting it to the Minimalist framework, it is argued that certain agreement patterns are the result of the quantifier bearing a set of abstract features that do not match its morphologically-triggered ones. Variations in QNP agreement patterns are then argued to be subject to constraints at the interfaces of syntax with both semantics and morphology. Overall, it is claimed that even apparent cases of non-local agreement with non-nominative NPs do not really pose a counterexample to established models of agreement, and that this supports the view that the system of ϕ-features cannot be simply an unstructured bundle of morphological features.

APA, Harvard, Vancouver, ISO, and other styles

26

Keisler, H. Jerome. "Quantifier elimination for neocompact sets." Journal of Symbolic Logic 63, no. 4 (December 1998): 1442–72. http://dx.doi.org/10.2307/2586661.

Full text

Abstract:

AbstractWe 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 is countably compact. To provide the necessary setting we introduce the notion of a law structure. This notion was motivated by the probability law of a random variable. However, in this paper we discuss a variety of model theoretic examples of the notion in the light of our quantifier elimination results.

APA, Harvard, Vancouver, ISO, and other styles

27

POLLARD, CARL J., and EUN JUNG YOO. "A unified theory of scope for quantifiers and wh-phrases." Journal of Linguistics 34, no. 2 (September 1998): 415–45. http://dx.doi.org/10.1017/s0022226798007099.

Full text

Abstract:

This paper presents an analysis of quantifier and wh-operator scope in terms of a lexicalized theory of quantifier storage, within the framework of Head-Driven Phrase Structure Grammar. The proposed analysis provides an alternative to the derivational approach wherein quantifier scope is determined at a separate level of representation via movement, and shows how scope of quantifiers and wh-phrases (fronted or in situ) can be handled in a unified way in a constraint-based grammar. Lexicalization of quantifier storage offers an account of scope facts in raising and unbounded dependency constructions which have been problematic in an earlier constraint-based approach to quantifier scope.

APA, Harvard, Vancouver, ISO, and other styles

28

Slade, Benjamin. "Quantifier particle environments." Linguistic Variation 19, no. 2 (July 9, 2019): 280–351. http://dx.doi.org/10.1075/lv.17007.sla.

Full text

Abstract:

Abstract I examine the set of environments in which KA-type quantifier particles appear crosslinguistically. These environments include interrogatives, disjunctions, indefinites, all of which arguably involve elements with Hamblin-type ‘alternative’ semantic values. I show that if KA-particles are assigned a uniform denotation as variables over choice functions we can account for their appearance in what otherwise appears to be a set of heterogeneous environments. Crosslinguistic and diachronic variation in the distribution of Q-particles – including, in some cases, the appearance of multiple morphologically-distinct Q-particles in different contexts – can be handled largely in terms of differing formal morphosyntactic features and/or pragmatic components of specific KA-particles. This study focuses on tracking the evolution of KA-type particles in the history of Sinhala, with comparison to other languages of the Indian subcontinent (including Malayalam and Tamil) as well as to Japanese, Tlingit, and English.

APA, Harvard, Vancouver, ISO, and other styles

29

Zhukovskii, M. E., and A. D. Matushkin. "Spectra of first-order formulas with a low quantifier depth and a small number of quantifier alternations." Doklady Mathematics 96, no. 1 (July 2017): 326–28. http://dx.doi.org/10.1134/s1064562417040093.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Mares, Edwin D., and Robert Goldblatt. "An alternative semantics for quantified relevant logic." Journal of Symbolic Logic 71, no. 1 (March 2006): 163–87. http://dx.doi.org/10.2178/jsl/1140641167.

Full text

Abstract:

AbstractThe quantified relevant logic RQ is given a new semantics in which a formula ∀xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of ‘extensional confinement’: ∀x(A ⋁ B) → (A ⋁ ∀xB), with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation.

APA, Harvard, Vancouver, ISO, and other styles

31

Zimmermann, Malte. "Pluractional Quantifiers: The 'occasional'-construction in English and German." Semantics and Linguistic Theory 10 (April 3, 2015): 290. http://dx.doi.org/10.3765/salt.v10i0.2728.

Full text

Abstract:

I investigate a syntactic construction which raises an interesting question for compositionality: An adjective seems to be interpreted outside its containing DP, taking scope over the entire sentence. With Larson (1999), I assume that the adjective incorporates into the DP-determiner, forming a complex quantifier. I present independent evidence in favour of such an analysis. Furthermore, I argue that Larson's semantic account of D-A-incorporation is in need of revision. I propose an alternative, more empirically adequate analysis which treats D+A composites as Lasersohnian (1995) pluractional quantifiers.

APA, Harvard, Vancouver, ISO, and other styles

32

Zimmermann, Malte. "Pluractional Quantifiers: The occasional-construction in English and German." Semantics and Linguistic Theory 10 (September 3, 2000): 290. http://dx.doi.org/10.3765/salt.v10i0.3115.

Full text

Abstract:

I investigate a syntactic construction which raises an interesting question for compositionality: An adjective seems to be interpreted outside its containing DP, taking scope over the entire sentence. With Larson (1999), I assume that the adjective incorporates into the DP-determiner, forming a complex quantifier. I present independent evidence in favour of such an analysis. Furthermore, I argue that Larson' s semantic account of D-A-incorporation is in need of revision. I propose an alternative, more empirically adequate analysis which treats D+ A composites as Lasersohnian (1995) pluractional quantifiers.

APA, Harvard, Vancouver, ISO, and other styles

33

González, L. J., M. B. Lattanzi, and A. G. Petrovich. "An Alternative Definition of Quantifiers on Four-Valued Łukasiewicz Algebras." Logica Universalis 11, no. 4 (November 7, 2017): 439–63. http://dx.doi.org/10.1007/s11787-017-0181-4.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Belaiche, T., and F. Leriche. "Détermination des effets synergiques ou antagonistes de plusieurs substances antimicrobiennes : application d’un plan d’expériences factoriel." Phytothérapie 17, no. 5 (November 4, 2018): 235–39. http://dx.doi.org/10.3166/phyto-2018-0076.

Full text

Abstract:

Suite à l’émergence de germes mutants résistants aux antibiotiques classiques, les recherches sont en train de s’orienter vers des substances naturelles. En effet, plusieurs huiles essentielles (HE) extraites de plantes sont pourvues d’un large spectre antibactérien et antifongique. L’utilisation de combinaisons (HE/HE) ou (HE/antibiotique) peut s’avérer plus efficace contre ces germes. En se fondant sur la méthodologie des plans d’expériences factoriels, nous avons mis au point une méthode permettant de quantifier et de classer l’activité antimicrobienne de plusieurs terpènes simultanément envers Staphylococcus aureus. Leurs effets d’interactions synergiques ou antagonistes ont également pu être quantifiés moyennant un nombre restreint d’essais.

APA, Harvard, Vancouver, ISO, and other styles

35

Steckhan, Nico, and Bert Arnrich. "Quantified Complementary and Alternative Medicine: Convergence of Digital Health Technologies and Complementary and Alternative Medicine." Complementary Medicine Research 27, no. 3 (2020): 131–33. http://dx.doi.org/10.1159/000506672.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Agegnehu, Dejen, P. K. Mahajan, and R. K. Gupta. "An alternative approach for construction of strata using quantified sensitivity level." Journal of Applied and Natural Science 13, no. 3 (September 15, 2021): 807–14. http://dx.doi.org/10.31018/jans.v13i3.2679.

Full text

Abstract:

The study is investigated on an alternative method for the construction of strata using sensitivity level when the samples are selected with simple random sampling with replacement (SRSWR) and the data are collected by scrambled optional randomization technique on the sensitive characters. Thus, the optional randomized response model , where k is a random variable having value 1 if the response is scrambled and 0 otherwise, was considered for finding out Approximate Optimum Strata Boundaries by minimizing the variance of the estimator . The cum. was proposed for finding out Approximate Optimum Strata Boundary in Neyman allocation for the optional scrambled response. This is applicable for wider classes of sampling design and estimators in stratification. The proposed rule on optional scrambled randomized response is efficient and can be used effectively for the construction of optimum strata boundary via Rectangular, Right triangular and Exponential distribution.

APA, Harvard, Vancouver, ISO, and other styles

37

Perovic, Aleksandar, Nedeljko Stefanovic, Milos Milosevic, and Dejan Ilic. "Automated reasoning-alternative methods." Serbian Journal of Electrical Engineering 1, no. 3 (2004): 15–20. http://dx.doi.org/10.2298/sjee0403015p.

Full text

Abstract:

Our main goal is to describe a potential usage of the interpretation method (i.e. formal representation of one first order theory into another) together with quantifier elimination procedures developed in the GIS.

APA, Harvard, Vancouver, ISO, and other styles

38

Piasecki, Maciej. "Self-organising Logic of Structures as a Basis for a Dependency-based Dynamic Semantics Model." Cognitive Studies | Études cognitives, no. 13 (June 21, 2015): 25–55. http://dx.doi.org/10.11649/cs.2013.002.

Full text

Abstract:

Self-organising Logic of Structures as a Basis for a Dependency-based Dynamic Semantics ModelWe present Self-organising Logic of Structures (SLS), a semantic representation language of high expressive power, which was designed for a fully compositional representation of discourse anaphora following the Dynamic Semantics paradigm. The application of SLS to the description of possible meanings of Polish multiple quantifier sentences is discussed. Special attention is paid to the phenomena of: cardinality dependency/independency of Noun Phrase quantifiers and variety of quantification. Semantic representation based on several formal operators is proposed. They can be combined in many different ways, if one takes a purely theoretical perspective. However, in the paper we show that this huge number is practically reduced in the language use and is governed by several constraints motivated by the analysis of Polish language data. The Hypothesis of Local Range of Cardinality Dependency is formulated as an alternative to representations based on quantifier rising technique. SLS provides a multi-layered language description of inter-linked representation of sever antification, reference, presupposition and anaphora.

APA, Harvard, Vancouver, ISO, and other styles

39

Moores, Bradley, Janet Simons, Song Xu, and Zoya Leonenko. "AFM-assisted fabrication of thiol SAM pattern with alternating quantified surface potential." Nanoscale Research Letters 6, no. 1 (2011): 185. http://dx.doi.org/10.1186/1556-276x-6-185.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Hou, FG. "Quantified diagnositic standard for large intestinal cancer of spleen qi deficiency syndrome." Journal of Chinese Integrative Medicine 7, no. 9 (September 15, 2009): 814–18. http://dx.doi.org/10.3736/jcim20090903.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Wang, Jie. "Research on quantified diagnosis and combining diseases with syndrome of blood stasis." Journal of Chinese Integrative Medicine 1, no. 1 (May 15, 2003): 21–24. http://dx.doi.org/10.3736/jcim20030110.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Kawanabe, Tadaaki, Mieko Tanigawa, Sachiko Kakizaki, Nur Diyana Kamarudin, Xiaoyu Mi, Toshihiko Hanawa, and Hiroshi Odaguchi. "Correlation between tongue body colour, as quantified by machine learning, and clinical indices." Advances in Integrative Medicine 7, no. 1 (March 2020): 8–13. http://dx.doi.org/10.1016/j.aimed.2019.01.005.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Silva, Rita Barros, Rui Fragoso, Carlos Sanches, Mario Costa, and Susete Martins-Dias. "Which chlorine ions are currently being quantified as total chlorine on solid alternative fuels?" Fuel Processing Technology 128 (December 2014): 61–67. http://dx.doi.org/10.1016/j.fuproc.2014.07.003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Heinrich, S., C. Ward Henson, and L. C. Moore. "A note on elementary equivalence of C(K) spaces." Journal of Symbolic Logic 52, no. 2 (June 1987): 368–73. http://dx.doi.org/10.2307/2274386.

Full text

Abstract:

In this paper we give a closer analysis of the elementary properties of the Banach spaces C(K), where K is a totally disconnected, compact Hausdorff space, in terms of the Boolean algebra B(K) of clopen subsets of K. In particular we sharpen a result in [4] by showing that if B(K1) and B(K2) satisfy the same sentences with ≤ n alternations of quantifiers, then the same is true of C(K1) and C(K2). As a consequence we show that for each n there exist C(K) spaces which are elementarily equivalent for sentences with ≤ n quantifier alternations, but which are not elementary equivalent in the full sense. Thus the elementary properties of Banach spaces cannot be determined by looking at sentences with a bounded number of quantifier alternations.The notion of elementary equivalence for Banach spaces which is studied here was introduced by the second author [4] and is expressed using the language of positive bounded formulas in a first-order language for Banach spaces. As was shown in [4], two Banach spaces are elementarily equivalent in this sense if and only if they have isometrically isomorphic Banach space ultrapowers (or, equivalently, isometrically isomorphic nonstandard hulls.)We consider Banach spaces over the field of real numbers. If X is such a space, Bx will denote the closed unit ball of X, Bx = {x ϵ X∣ ∣∣x∣∣ ≤ 1}. Given a compact Hausdorff space K, we let C(K) denote the Banach space of all continuous real-valued functions on K, under the supremum norm. We will especially be concerned with such spaces when K is a totally disconnected compact Hausdorff space. In that case B(K) will denote the Boolean algebra of all clopen subsets of K. We adopt the standard notation from model theory and Banach space theory.

APA, Harvard, Vancouver, ISO, and other styles

45

Lavallée, Daniel, Claude Marche, and Tung Quach. "De nouvelles approches pour quantifier le risque de rupture d'une retenue d'eau." Canadian Journal of Civil Engineering 27, no. 6 (December 1, 2000): 1217–29. http://dx.doi.org/10.1139/l00-080.

Full text

Abstract:

Construction of dams on streams allows multiple beneficial uses to the population. But in the advent of extreme floods, the structures may fail and free the stored water. Recently built structures respond to more and more demanding design standards. Older structures, which were deemed safe at the time of their construction, might sometimes no longer satisfy these new standards. To evaluate the necessity, the importance and the urgency of works that would make these structures conform again, one of the more and more used approaches consists in resorting to a risk analysis. A risk analysis has been applied a posteriori on a site where a failure was observed in order to determine whether this approach would have brought the managers to undertake corrective works. This application shows the limited capacity of the conventional risk analysis for dams. Two alternative approaches are presented and discussed as a tool to evaluate the risk of a site.Key words: risk analysis, dam break, dam, public safety.[Journal translation]

APA, Harvard, Vancouver, ISO, and other styles

46

Zimmermann, Malte. "Variation in the expression of universal quantification and free choice." Linguistic Variation Yearbook 2008 8 (December 31, 2008): 179–232. http://dx.doi.org/10.1075/livy.8.06zim.

Full text

Abstract:

I argue that the interpretation of expressions consisting of disjunction marker and wh-element (wh-disj expressions), which varies across languages, constitutes a case of semantic variation. In Hausa, these expressions denote universal generalized quantifiers, which give rise to free choice effects in intensional contexts (Giannakidou 2001). The universal meaning is derived in compositional fashion, where the disjunction marker expresses set union over the wh-domain. The free choice effects follow from the scopal interaction of universal quantifier and intensional operator. The account relates to Giannakidou & Cheng’s (2006) analysis of (quasi)universal FCIs, but it does not extend to Japanese and Malayalam wh-disj expressions, which are interpreted with existential force and should be analyzed as indeterminate pronouns (Jayaseelan 2001; Kratzer & Shimoyama 2002). Motivated by the analysis of FCIs in Menendéz-Benito (2005), we finally consider an alternative analysis of koo-wh expressions as selective indeterminate pronouns, which is rejected on conceptual and empirical grounds.

APA, Harvard, Vancouver, ISO, and other styles

47

Spadacini, Giordano, Flavia Grassi, Sergio A. Pignari, Patrick Bisognin, and Alexandre Piche. "Bulk Current Injection as an Alternative Radiated Susceptibility Test Enforcing a Statistically Quantified Overtesting Margin." IEEE Transactions on Electromagnetic Compatibility 60, no. 5 (October 2018): 1270–78. http://dx.doi.org/10.1109/temc.2018.2810074.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Bellantoni, Stephen, and Martin Hofmann. "A new “feasible” arithmetic." Journal of Symbolic Logic 67, no. 1 (March 2002): 104–16. http://dx.doi.org/10.2178/jsl/1190150032.

Full text

Abstract:

AbstractA classical quantified modal logic is used to define a “feasible” arithmetic whose provably total functions are exactly the polynomial-time computable functions. Informally, one understands ⃞∝ as “∝ is feasibly demonstrable”. differs from a system that is as powerful as Peano Arithmetic only by the restriction of induction to ontic (i.e., ⃞-free) formulas. Thus, is defined without any reference to bounding terms, and admitting induction over formulas having arbitrarily many alternations of unbounded quantifiers. The system also uses only a very small set of initial functions.To obtain the characterization, one extends the Curry-Howard isomorphism to include modal operations. This leads to a realizability translation based on recent results in higher-type ramified recursion. The fact that induction formulas are not restricted in their logical complexity, allows one to use the Friedman A translation directly.The development also leads us to propose a new Frege rule, the “Modal Extension” rule: if ⊢ ∝ a then ⊢ A ↔ ∝ for new symbol A.

APA, Harvard, Vancouver, ISO, and other styles

49

Hartisch, Michael, Alexander Herbst, Ulf Lorenz, and Jonas Benjamin Weber. "Towards Resilient Process Networks - Designing Booster Stations via Quantified Programming." Applied Mechanics and Materials 885 (November 2018): 199–210. http://dx.doi.org/10.4028/www.scientific.net/amm.885.199.

Full text

Abstract:

Resilience of a technical system is the ability to overcome minor failures and thus to avoid a complete breakdown of its vital functions. A possible failure of the system's components is one critical case the system designer should keep in mind. From another perspective resilience can be interpreted as the existence of alternative paths in a process network if resources break down. In this context we deal with process networks corresponding to systems which must be designed to operate in different scenarios. In order to ensure the system's functionality and to step in as a replacement in case of failure a set of optional resources must be available. This means that the process network must have several degrees of freedom allowing to react to uncertain events. With those restrictions we try to find a preferably resource-efficient network. Hence, an optimization problem arises which can be modeled using quantified mixed-integer linear programming. As an example of a process which can be modeled using process networks we investigate the problem of finding cost-efficient resilient topologies of fluid systems that are able to fulfill different load scenarios.

APA, Harvard, Vancouver, ISO, and other styles

50

de Castro, Jaime Tupiassú Pinho, Rodrigo Vieira Landim, and Marco Antonio Meggiolaro. "Defect tolerance under environmentally assisted cracking conditions." Corrosion Reviews 33, no. 6 (November 1, 2015): 417–31. http://dx.doi.org/10.1515/corrrev-2015-0070.

Full text

Abstract:

AbstractNotch sensitivity effects under environmentally assisted cracking (EAC) conditions have been recently quantified considering the tolerance to short cracks that may start at their tips and become nonpropagating after growing for a while, a behavior that depends on the stress gradients ahead of the notch tips and on the basic material resistances to crack initiation and propagation inside an aggressive medium. This model can provide a powerful alternative design tool for the pass/nonpass criterion traditionally used to deal with such mechanical-chemical problems, since it properly considers and quantifies the stress analysis issues that affect them. The model uses the analogy between the notch sensitivity behavior under fatigue and under EAC conditions, so it quantifies how the stress gradient around the notch tips affects the tolerance to mechanically short cracks that depart from there, considering the characteristics of the loading and of the notch geometry, as well as the basic material properties inside the given environment, expressed by its EAC resistances to crack initiation from a smooth surface SEAC and to crack propagation KIEAC, without the need for any data fitting parameter. Moreover, since this model has been validated by proper tests, it can be used to propose a defect-tolerant design criterion under EAC conditions that includes the unavoidable notch effects always present in actual structural components.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!