Related papers: Robinson consistency in many-sorted hybrid first-o…
We provide a version of first-order hybrid tense logic with predicate abstracts and definite descriptions as the only non-rigid terms. It is formalised by means of a tableau calculus working on sat-formulas. A particular theory of DD…
Isabelle/HOL augments classical higher-order logic with ad-hoc overloading of constant definitions---that is, one constant may have several definitions for non-overlapping types. In this paper, we present a mechanised proof that HOL with…
Subtyping, also known as subtype polymorphism, is a concept extensively studied in programming language theory, delineating the substitutability relation among datatypes. This property ensures that programs designed for supertype objects…
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^{r}$ divides the order of a finite group, then the number of subgroups of order $p^{r}$ is $\equiv$ 1(mod $p$).…
The interpolant existence problem (IEP) for a logic L is to decide, given formulas P and Q, whether there exists a formula I, built from the shared symbols of P and Q, such that P entails I and I entails Q in L. If L enjoys the Craig…
This paper shows that the interpolation theorem fails in the intuitionistic logic of constant domains. This result refutes two previously published claims that the interpolation property holds.
We prove a homological stability theorem for congruence subgroups of symplectic groups. From this theorem, we deduce a generalization of a theorem of Borel showing that certain homology groups of a congruence subgroup do not depend on the…
We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…
In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…
We prove the theorems which are equivalent to the Roland's results such that a new form of them allows to consider some generalizations. In particular, we give generators of primes more than a fixed prime.
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
Probability theory as extended logic is completed such that essentially any probability may be determined. This is done by considering propositional logic (as opposed to predicate logic) as syntactically suffcient and imposing a symmetry…
Local-order-invariant (first-order) logic is an extension of first-order logic where formulae have access to a ternary local order relation on the Gaifman graph, provided that the truth value does not depend on the specific order relation…
We prove that there are continuum-many axiomatic extensions of the full Lambek calculus with exchange that have the deductive interpolation property. Further, we extend this result to both classical and intuitionistic linear logic as well…
We present an elementary proof of a general version of Montel's theorem in several variables which is based on the use of tensor product polynomial interpolation. We also prove a Montel-Popoviciu's type theorem for functions…
We investigate the first order implicit linear difference equation over residue class rings modulo m. We prove an existence criterion and establish the amount of solutions for this equation. We obtain analogous results for the initial…
Utilising some recent ideas from our bilinear bi-parameter theory, we give an efficient proof of a two-weight Bloom type inequality for iterated commutators of linear bi-parameter singular integrals. We prove that if $T$ is a bi-parameter…
We introduce a combinatorial criterion for verifying whether a formula is not the conjunction of an equation and a co-equation. Using this, we give a proof for the nonequationality of the free group. Furthermore, we generalize the latter…
Although conventional logical systems based on logical calculi have been successfully used in mathematics and beyond, they have definite limitations that restrict their application in many cases. For instance, the principal condition for…