Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 100 for “"Quantifier"”.
-
Algorithmic strategies for applicable real quantifier elimination
One of the most important algorithms for real quantifier elimination is the quantifier elimination by virtual substitution introduced by Weispfenning in 1988. In this thesis we present numerous algorithmic approaches for optimizing this quantifier elimination algorithm. Optimization goals are the …
-
Quantifier rank spectrum of L-infinity-omega
In Part A we will study the quantifier rank spectrum of sentences of L!1,!. We will show that there are scattered sentences with models of arbitrarily high but bounded quantifier rank. We will also consider the case of weakly scattered and almost scattered sentences, and we will make some …
-
Extending a quantifier scope resolution algorithm by accounting for negation.
… Typical of this is the problem of resolving quantifier scope ambiguity. In this report we investigate the thesis that the QC algorithm of Saba and Corriveau can be extended to account for negation. We propose an extension to Saba and Corriveau QC algorithm. Paper copy at Leddy Library: Theses …
-
All about alles: The syntax of wh-quantifier float in German
… thesis offers an in-depth investigation of “wh-quantifier float” of the quantifying particle ‘alles’ in German. 'Alles' (etymologically, ‘all’) appears in wh-questions like 'Wen alles hat die Mare eingeladen?' (‘Who-all did Mare invite?’). The thesis focuses on the syntactic distribution of …
-
Quantifier elimination and decidability of the theory of additive integer group augmented by predicates of multiplicative cyclic submonoids
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-14 without embargo terms
-
Cyclicity and the scope of wh-phrases
… that in a constituent question with a universal quantifier, syntactic reconstruction of the wh-phrase below the quantifier is the source of scope ambiguities. In particular, I argue, based on the interaction of PL-readings with binding conditions A and B, that syntactic reconstruction of the …
-
Verification of advanced controllers for safety-critical systems
… as the Satisfiability Modulo Theories (SMT) and quantifier elimination (Weispfenning’s virtual term substitution and quantifier elimination by cylindrical algebraic decomposition) algorithms. Any control design requirement (such as satisfactory performance, robustness to uncertainties, stability, …
-
Partitive Structures
… using such common nouns. In the partitive, the quantifier by itself is used to refer to a part of an entity (e.g., three of the students ). This study examines partitives in Korean and English and argues that partitives share the structure with other constructions expressing PART-OF relations …
-
The syntactic and semantic roots of floating quantification
Through the study of floating quantifiers in a variety of languages, I demonstrate that floating quantification is not a uniform phenomenon and outline a series of puzzles that force us to adopt a two-part analysis. I argue that certain floating quantifiers are related to their nominal associate by …
-
Model theory and probability
… logic. The author studies axioms, type spaces, quantifier elimination, separable categoricity, saturated models, stability, and d-finiteness for the theories of atomless probability algebras and atomless random variable structures. Explicit formulas for the d*-metric between types in the theory …
-
Modest Automorphisms of Presburger Arithmetic
… that enable us in Chapters 4 and 5 to prove quantifier elimination, decidability, and axiomatizability for both the quotient and the Presburger structure expanded by this automorphism, with explicit axiomatizations given in Chapter 3. The second automorphism is maximal in the sense that its …
-
Upper and Lower Complexity Bounds for Some Problems in Elementary Geometry
… is used to encode polynomials, the length of any quantifier-free formula expressing the set I (2n,n) is bounded from below by Ω(c n ). Other related complexity results are stated; in particular, a lower bound for algebraic computation trees based on the notion of limiting hypersurface is …
-
Évaluation du potentiel énergétique de la biomasse forestière au Nouveau-Brunswick pour la production de chaleur et d'électricité en cogénération
"L'étude cherche à quantifier les puissances thermiques et électrique pouvant être générées à partir de cette biomasse lorsque celle-ci est utilisée comme source de combustible dans des centrales de cogénération réparties sur l'ensemble du territoire néo-brunswickois."
-
Quantified assessment to enhance student learning in the sciences at UWC
… Questionnaire (AEQ) could be standardized as a quantifier of assessment and be used at a multicultural institute such as the University of the Western Cape (UWC). This questionnaire was created in the United Kingdom to assist lecturers in evaluating and developing their assessment systems.
-
Model Theory of Nakano Spaces
… fixed compact essential range is shown to admit quantifier elimination. It is also shown that if this essential range is moreover bounded away from 1, the latter theory is model-theoretically stable.
-
Cylindrical Decomposition Under Application-Oriented Paradigms
Quantifier elimination (QE) is a powerful tool for problem solving. Once a problem is expressed as a formula, such a method converts it to a simpler, quantifier-free equivalent, thus solving the problem. Particularly many problems live in the domain of real numbers, which makes real QE very …
-
Model theory of algebraically closed fields and the Ax-Grothendieck Theorem
… results about algebraically closed fields is the quantifier elimination property. We also show that the theory of algebraically closed field with a given characteristic is complete and model-complete. Finally, we introduce the beautiful Ax-Grothendieck theorem and an application to it.
-
Floating and Non-floating Quantifiers in Hijazi Arabic: an HPSG Analysis
… and analysis of floating and non-floating quantifiers in Hijazi Arabic (HA) within the framework of Head-Driven Phrase Structure Grammar (HPSG). This work is a contribution to the long-standing debate on the relation between floating and non-floating quantifiers. It investigates the …
Page 1 of 5