Related papers: Constructive reflectivity principles for regular t…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…
We consider the problem of deciding $\omega$-regular properties on infinite traces produced by linear loops. Here we think of a given loop as producing a single infinite trace that encodes information about the signs of program variables at…
Keimel and Lawson proposed a set of conditions for proving a category of topological spaces to be reflective in the category of all T0 spaces. These conditions were recently used to prove the reflectivity of the category of all…
One of the consequences of the Compactness Principle in structural Ramsey theory is that the small Ramsey degrees cannot exceed the corresponding big Ramsey degrees, thereby justifying the choice of adjectives. However, it is unclear what…
The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these…
A class of models intended to be as minimal and structureless as possible is introduced. Even in cases with simple rules, rich and complex behavior is found to emerge, and striking correspondences to some important core known features of…
Stochastic models such as Continuous-Time Markov Chains (CTMC) and Stochastic Hybrid Automata (SHA) are powerful formalisms to model and to reason about the dynamics of biological systems, due to their ability to capture the stochasticity…
In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…
We describe a new class of positive linear discrete-time switching systems for which the problems of stability or stabilizability can be resolved constructively. This class generalizes the class of systems with independently switching state…
The main result of this paper is that every naturally reductive space can be explicitly constructed from the construction in \cite{Storm2018}. This gives us a general formula for any naturally reductive space and from this we prove…
We provide a semi-grammatical description of the set of normal proofs of positive formulae in minimal predicate logic, i.e. a grammar that generates a set of schemes, from each of which we can produce a finite number of normal proofs. This…
We show that it is possible to define a realizability interpretation for the $\Sigma_2$-fragment of classical Analysis using G\"odel's System T only. This supplements a previous result of Schwichtenberg regarding bar recursion at types 0…
Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for…
Motivated by structural properties of differential field extensions, we introduce the notion of a theory $T$ being derivation-like with respect to another model complete theory $T_0$. We prove that when $T$ admits a model companion $T_+$,…
We introduce a version of logic for metric structures suitable for applications to C*-algebras and tracial von Neumann algebras. We also prove a purely model-theoretic result to the effect that the theory of a separable metric structure is…
We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and…
We characterize $t$-structures in stable $\infty$-categories as suitable quasicategorical factorization systems. More precisely we show that a $t$-structure $\mathfrak{t}$ on a stable $\infty$-category $\mathbf{C}$ is equivalent to a normal…
The chase is a sound, complete, but possibly non-terminating algorithm for reasoning with existential rules (aka. tuple-generating dependencies), a highly expressive knowledge representation language. Although the procedure appears simple,…
We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…