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 13 of 13 for “"second-order logic"”.
-
Second Order Logic and Logical Form
… explores several related issues surrounding second order logic. The central problem running throughout is whether second order logic should provide the underlying logic for formalizations of natural language. A prior problem is determining the significance of this choice. Such controversies …
-
Weighted Logics and Weighted Simple Automata for Context-Free Languages of Infinite Words
… provided a seminal connection between monadic second-order logic and finite automata for both finite and infinite words. This BET- Theorem has been extended by Lautemann, Schwentick and Thérien to context-free languages by introducing a monadic second-order logic with an additional …
-
Easy instances for model checking
… intimately related to the expressibility of the logical language in question. We investigate the parameterized complexity of queries expressible in monadic second order logic over tree-like structures (structures with bounded tree-width) and first order logic over locally tree-like structures. …
-
Guarded logics : algorithms and bisimulation
For many practical applications of logic-based methods there is a requirement to balance expressive power against computational tractability. Both identifying decidable sub-classes of first-order logic, and extending modal logic to larger, but nevertheless efficiently solvable languages has been a …
-
Modular data structure verification
… write Jahob specifications in classical higher-order logic (HOL); Jahob reduces the verification problem to deciding the validity of HOL formulas. I present a new method for proving HOL formulas by combining automated reasoning techniques. My method consists of 1) splitting formulas into …
-
Expressiveness and Decidability of Weighted Automata and Weighted Logics
… grammars, regular expressions, and monadic second order (MSO) logic. To increase expressiveness, the fundamental idea underlying finite automata and regular languages was also extended to describe not only languages of strings, or words, but also of infinite words by Büchi and Muller, finite …
-
Finite automata on unranked trees : extensions by arithmetical and equality constraints
… documents. In particular, several automata and logic formalisms on unranked trees have been considered (again) in the literature, and many results that had previously been shown for the ranked-tree setting have turned out to hold for the unranked-tree setting as well. In this thesis, we study …
-
Logic and games on automatic structures
The evaluation of a logical formula can be viewed as a game played by two opponents, one trying to show that the formula is true and the other trying to prove it false. This correspondence is exploited algorithmically to evaluate formulas of first and second-order logic on finite structures. We …
-
Automata-based decision procedures for weak arithmetics
… A prominent example is the weak monadic second-order logic <br>of one successor, WS1S for short, which is tightly connected to <br>automata over finite words. Nowadays, automata have also emerged as a <br>tool for effectively mechanizing decision procedures for such logical <br>theories. …
-
A defence of predicativism as a philosophy of mathematics
… the critical task by detailing the epistemological problems with the classical account of the continuum. Explanations of classicism which appeal to second-order logic, set theory, and primitive intuition are examined and are found wanting. Chapter 5 aims to dispell the worry that …
-
Structures of bounded partition width
… width it is possible to encode, in a first-order way, all subsets of some infinite set by single elements. After having obtained a class of simple structures the obvious next question is whether this characterisation is precise. That is, we would like to prove that all other structures have …
-
Automatic techniques for proving correctness of heap-manipulating programs
… verification. This dissertation presents two logic-based automatic software verification systems, namely Strand and Dryad, that help in the task of verification of heap-manipulating programs, which is one of the most complex aspects of modern software that eludes automatic verification. Strand …
-
Automaty v rozhodovacích procedurách a výkonnostní analýze
Tato práce se věnuje vylepšení současného stavu formalní analýzy a verifikace založené na automatech a zaměřené na systémy s nekonečnými stavovými prostory. V první části se práce zabývá dvěma rozhodovacími procedurami pro logiku WS1S, které jsou založené na korespondenci mezi formulemi logiky WS1S …