-
Despite substantial recent advances in language models (LMs), their syntactic competence remains largely unexplored in low-resource languages. Lithuanian presents a particularly interesting test case due to its rich morphology and the scarcity of evaluation resources. The only existing benchmark ...
-
This dissertation is a proof-theoretical investigation on some variants of free-choice logics from the standpoint of inferential expressivism.
The phenomenon of free-choice inference has been recently studied in the context of team semantics, starting with [Alo22]. Advancements in this tradition...
-
Bilateralist proof systems, in which the speech acts of assertion and rejection are taken to be both primitive and formulae are presented in assertive and rejective form, have enjoyed a diverse and conspicuous development in the past decades. Not only natural deduction, but sequent calculus formu...
-
We use arrow algebras to construct a topos for monotone modified realizability. We also define a category of assemblies that characterizes the ¬¬-separated objects in the topos. We discuss common logical principles, including independence of premise, the axiom of choice, and the existence of the ...
-
Many provability logics enjoy fixpoint theorems. This provides a natural motivation for studying non-wellfounded proof systems for such logics, as non-wellfounded proof systems are well-suited for defining proof systems for modal logics with fixpoints. Nevertheless, comparatively few provability ...
-
In (Pinto Prieto, 2024) it is shown how Dempster-Shafer theory can be combined with Topological models of evidence into a unified Multi-Layer Belief Model that efficiently handles the combination of uncertain, partial and mutually contradictory pieces of evidence. More precisely, the topological ...
-
As large language models (LLMs) increasingly populate everyday writing, certain words and stylistic habits have come to be perceived as telltale signs of machine authorship, reportedly prompting some writers to avoid them. This thesis investigates this oppositional pathway of LLM-driven language ...
-
Abstract Undecidability of the equational theory of the class RA of
relation algebras can easily be proved using the undecidability of
the wordproblem for semigroups. With some effort and ingenuity, one
can push this proof through for the larger class SA. We provide
another "cause" for undecid...
-
Abstract Relativization is one of the central topics in the study of
algebras of relations (i.e. relation and cylindric algebras). Relativized
representable relation algebras behave much nicer than the original class
RRA: for instance, one obtains finite axiomatizability, decidability and
ama...
-
We investigate transfer of interpolation in such combinations of modal
logic which lead to interaction of the modalities. Combining logics
by taking products often blocks transfer of interpolation. The same
holds for combinations by taking unions, a generalization of
Humberstone's inaccessibili...
-
In this paper we apply the methodology of Labelled Deductive Systems to the
tableau method in order to obtain a deductive framework for substructural
logics which incorporates the facility of model generation. For this
special purpose, we propose new labelled tableau calculi TL and TLe for two...