Related papers: Semantic A-translation and Super-consistency entai…
The main novelty of this paper is to consider an extension of the Calculus of Constructions where predicates can be defined with a general form of rewrite rules. We prove the strong normalization of the reduction relation generated by the…
The model theory of a first-order logic called N^4 is introduced. N^4 does not eliminate double negations, as classical logic does, but instead reduces fourfold negations. N^4 is very close to classical logic: N^4 has two truth values;…
We prove that every proper subclass of the 321-avoiding permutations that is defined either by only finitely many additional restrictions or is well quasi-ordered has a rational generating function. To do so we show that any such class is…
Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…
Motivated by the notion of a set of uniqueness in a locally compact group $G$, we introduce and study ideals of uniqueness in the Fourier algebra $A(G)$ of $G$, and their accompanying operator version, masa-bimodules of uniqueness. We…
We use automated theorem provers to significantly shorten a formal development in higher order set theory. The development includes many standard theorems such as the fundamental theorem of arithmetic and irrationality of square root of…
The meaning of a natural language utterance is largely determined from its syntax and words. Additionally, there is evidence that humans process an utterance by separating knowledge about the lexicon from syntax knowledge. Theories from…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
The quasi-normal modal logic GLS is a provability logic formalizing the arithmetical truth. Kushida (2020) gave a sequent calculus for GLS and proved the cut-elimination theorem. This paper introduces semantical characterizations of GLS and…
In this paper we extend the research programme in algebraic proof theory from axiomatic extensions of the full Lambek calculus to logics algebraically captured by certain varieties of normal lattice expansions (normal LE-logics).…
The algebraic structure underlying the classical $r$-matrix formulation of the complex sine-Gordon model is fully elucidated. It is characterized by two matrices $a$ and $s$, components of the $r$ matrix as $r=a-s$. They obey a modified…
On the ground of a general theorem concerning the admissibility of the structural rules in sequent calculi with additional atomic rules, we develop a proof theoretic analysis for several extensions of the ${\bf G3[mic]}$ sequent calculi…
The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical…
One of the main claims of the paper is that Dirac's calculus and broader theories of physics can be treated as theories written in the language of Continuous Logic. Establishing its true interpretation (model) is a model theory problem. The…
In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper details some of the steps of this transformation.
We prove a theorem which gives a bijection between the support $\tau$-tilting modules over a given finite-dimensional algebra $A$ and the support $\tau$-tilting modules over $A/I$, where $I$ is the ideal generated by the intersection of the…
The term {\em meta-programming} refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis…
We generalize the notion of semi-universality in the classical deformation problems to the context of derived deformation theories. A criterion for a formal moduli problem to be semi-prorepresentable is produced. This can be seen as an…