Related papers: A constructive proof of Skolem theorem for constru…

This paper provides two extensions of first order logic by `$\omega$-rules'. In each case we characterize the countable structures whose theory in the logic is categorical (has a unique model). In the one-sorted inferential $\omega$-logic,…

The Svenonius theorem describes the (first-order) definability in a structure in terms of permutations preserving the relations of elementary extensions of the structure. In the present paper we prove a version of this theorem using…

We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Sigma_1 level of the…

Let $A$ be the $n$-th Weyl algebra over a field of characteristic zero, and $\varphi:A\rightarrow A$ an endomorphism with $S = \varphi(A)$. We prove that if $A$ is finitely generated as a left or right $S$-module, then $S = A$. The proof…

The isotrivial Mordell-Lang theorem of Moosa and Scanlon describes the set $X\cap\Gamma$ when $X$ is a subvariety of a semiabelian variety $G$ over a finite field $\mathbb{F}_q$ and $\Gamma$ is a finitely generated subgroup of $G$ that is…

It is well-known that every first-order property on words is expressible using at most three variables. The subclass of properties expressible with only two variables is also quite interesting and well-studied. We prove precise structure…

For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated…

Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

We investigate the position that foundational theories should be modelled on ordinary computability. In this context, we investigate the metamathematics of $\Sigma$ formulas. We consider theories whose axioms are implications between…

We present a necessary and sufficient condition for Alt's system to be represented by a continuous utility function. Moreover, we present a necessary and sufficient condition for this utility function to be concave. The latter condition can…

We develop a novel formal theory of finite structures, based on a view of finite structures as a fundamental artifact of computing and programming, forming a common platform for computing both within particular finite structures, and in the…

The aim of this note is to prove a representation theorem for left--invariant functionals in Carnot groups. As a direct consequence, we can also provide a $\Gamma$-convergence result for a smaller class of functionals.

Let $\Gamma^{(x_0)}$ be a finite rooted tree, for which $\Gamma$ is the underlying tree and $x_0$ the root. Let $T$ be the Terwilliger algebra of $\Gamma$ with respect to $x_0$. We study the structure of the principal $T$-module. As a…

We prove that if a continuous function $f : X \to f(X)$ takes open sets into elements of the Boolean algebra generated by open and closed subsets in $f(X)$, then there exist $X_n \subset X,$ $(n \in \omega)$ such that $f$ is open on every…

Logical frameworks provide natural and direct ways of specifying and reasoning within deductive systems. The logical framework LF and subsequent developments focus on finitary proof systems, making the formalization of circular proof…

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…

We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…

In this paper, we give a proof of the Hyers-Ulam stability of the Jensen functional equation $$f(xy)+f(x\sigma(y))=2f(x),\phantom{+} x,y\in{G},$$ where $G$ is an amenable semigroup and $\sigma$ is an involution of $G.$