Sökning: "quantifiers"
Visar resultat 1 - 5 av 15 avhandlingar innehållade ordet quantifiers.
1. Quantifiers and Theories : A Lazy Approach
Sammanfattning : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. LÄS MER
2. Lindström quantifiers and higher-order notions on finite structures
Sammanfattning : The expressive power of first-order logic is very limited on finite structures. One important way to obtain stronger logics is to add Lindström quantifiers, and another is to add higher-order quantification. We investigate two different ways of combing the two approaches. LÄS MER
3. Syntactic variation in English quantified noun phrases with all, whole, both and half
Sammanfattning : The overall aim of the present study is to investigate syntactic variation in certain Present-day English noun phrase types including the quantifiers all, whole, both and half (e.g. a half hour vs. half an hour). LÄS MER
4. New techniques for handling quantifiers in Boolean and first-order logic
Sammanfattning : The automation of reasoning has been an aim of research for a long time. Already in 17th century, the famous mathematician Leibniz invented a mechanical calculator capable of performing all four basic arithmetic operators. LÄS MER
5. Stability theory in finite variable logic
Sammanfattning : This thesis studies finite variable theories. To be more precise. complete Ln -theories, where Ln is the set of formulas in a first order language L in which at most n distinct variables occur. These need not be complete in the usual first order sense. LÄS MER