-
State merging algorithms are predominant in Grammar Induction of
finite state machines. This thesis extends the state merging approach
to context-free grammars. It connects current standard implementations
of state merging to compression-based learning. The exact same design
principles are applie...
-
Left-sequential logics provide a means for reasoning about (closed)
propositional terms with atomic propositions that may have side
effects and that are evaluated sequentially from left to right. Such
propositional terms are commonly used in programming languages to
direct the flow of a program. ...
-
The Paradoxes of Material Implication concern entailments which are
valid according to Classical Propositional Logic but which contradict
universal linguistic intuitions. These contradictions constitute one
of the best-known objections to the classical truth-functional account
of indicative condi...
-
We investigate the use of dialgebras for program semantics. Dialgebras
generalise both algebras and coalgebras. As a result dialgebras can
model compositional and interactive features of programs, in addition
to program state and behaviour over time. We investigate the theory of
universal dialgeb...
-
The topic of this thesis is the relationship between formal and
informal proofs. Chapter One opens the discussion by examining what a
proof is, when two proofs are identical, what the purpose of proving
is and how to distinguish the two categories of proof. Chapters Two
and Three focus in on info...
-
In this thesis we study the expressive power of variants of monadic
second-order logic (MSO) on infinite trees by means of automata. In
particular we are interested in weak MSO and well-founded MSO, where
the second-order quantifiers range respectively over finite sets and
over subsets of well-fo...
-
The axiomatic method counts two thousand and three hundred years
circa. Suppes has proposed the category of Euclidean-Archimedean
tradition to refer to the axiomatic theories that have been developed
before the inven- tion/discovery of the non-Euclidean
geometries. Among these theories the first...
-
This thesis is located in the field of provability and
interpretability logic, where modal logic is used in the study of
formal systems of arithmetic. The central notion of this thesis is
that of interpretability. The notion of interpretability can be seen
as a tool for comparing axiomatic theori...
-
The Ehrenfeucht-Fraïssé Game is very useful in studying separation and
equivalence results in logic. The usual finite Ehrenfeucht-Fraïssé
Game EFn characterizes separation in first order logic Lωω. The
infinite Ehrenfeucht-Fraïssé Game EFω and the Dynamic
Ehrenfeucht-Fraïssé Game EFDα characteriz...
-
Semantics of counterfactuals is normally developed according to the
principle of similarity, and the key point is to specify the notion of
relative similarity. It can be seen in specific examples that
causation plays a crucial role in determining the independence of
particular facts and thus also...
-
Friedman claims that Kant's constructive approach to geometry was
developed as a means to circumvent the limitations of his logic, which
has been widely regarded by various commentators as nothing more than
a glossa to Aristotelian subject-predicate logic. Contra Friedman, and
building on the wor...