Related papers: A constructive proof of Skolem theorem for constru…
A $\Gamma$-labeled graph is an oriented graph with edges invertibly labeled by a group $\Gamma$. We prove a structure theorem for $\Gamma$-labeled graphs which forbid a fixed $\Gamma$-labeled graph as an immersion, for any finite $\Gamma$.…
Given a class C of word languages, the C-separation problem asks for an algorithm that, given as input two regular languages, decides whether there exists a third language in C containing the first language, while being disjoint from the…
Symbol is used to describe the Springer correspondence for the classical groups. We prove two structure theorems of symbol. We propose a construction of the symbol of the rigid partitions in the $B_n$, $C_n$, and $D_n$ theories. This…
Recent developments in the categorical foundations of universal algebra have given fresh impetus to an understanding of the lambda calculus coming from categorical logic: an interpretation is a semi-closed algebraic theory. Scott's…
This article presents a computational semantics for classical logic using constructive type theory. Such semantics seems impossible because classical logic allows the Law of Excluded Middle (LEM), not accepted in constructive logic since it…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…
We introduce a notion of the ``explanation" of one (generalized) probabilistic model by another as particular kind of span in the category $\Prob$ of probabilistic models and morphisms. We show that explanations compose under a standard…
Game semantics aim at describing the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. In this article, we introduce a game semantics for a fragment of first order propositional logic. One…
Equational reasoning with string diagrams provides an intuitive means of proving equations between morphisms in a symmetric monoidal category. This can be extended to proofs of infinite families of equations using a simple graphical syntax…
The concept of (stable) weak containment for measure-preserving actions of a countable group $\Gamma$ is analogous to the classical notion of (stable) weak containment of unitary representations. If $\Gamma$ is amenable then the Rokhlin…
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
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…
This paper concerns an expansion of first-order Belnap-Dunn logic whose connectives and quantifiers all have a counterpart in classical logic. The language and logical consequence relation of this paradefinite logic are defined, a sequent…
We propose axioms governing the interaction of constructive assertibility and meaningfulness predicates with a self-applicative truth predicate characterized by the T-scheme, and we prove the consistency of the resulting formal system.
In this paper we introduce a modal theory $H_{\sigma}$, which is sound and complete for arithmetical $\Sigma$_1 substitutions in ${\bf HA}$, in other words, we will show that $H_{\sigma}$ is the $\Sigma$_1-provability logic of ${\bf HA}$.…
We study how to infer new choices from previous choices in a conservative manner. To make such inferences, we use the theory of choice functions: a unifying mathematical framework for conservative decision making that allows one to impose…
We present a combination of raising, explicit variable dependency representation, the liberalized delta-rule, and preservation of solutions for first-order deductive theorem proving. Our main motivation is to provide the foundation for our…
Given a compact set $K$ in the plane, which does not contain any triple of points forming a vertical and a horizontal segment, and a map $f\in C(K)$, we give a construction of functions $g,h\in C(\mathbb R)$ such that $f(x,y)=g(x)+h(y)$ for…
We introduce a new definition of a model for a formal mathematical system. The definition is based upon the substitution in the formal systems, which allows a purely algebraic approach to model theory. This is very suitable for applications…