Related papers: Herbrand's Theorem: a short statement and a model-…
Using the Hilbert-Schmidt theorem, we reformulate the R-matrix theory in terms of a uniformly and absolutely convergent expansion. Term by term differentiation is possible with this expansion in the neighborhood of the surface. Methods for…
It has been shown that quantum paradoxes have followed from one special assumption, i.e., from attributing basic physical meaning to Hamiltonian eigenfunctions and representing all physical states by vectors of the Hilbert space spanned on…
The phenomenon of an implicit function which solves a large set of second order partial differential equations obtainable from a variational principle is explicated by the introduction of a class of universal solutions to the equations…
Generalized relational theories with null values in the sense of Reiter are first-order theories that provide a semantics for relational databases with incomplete information. In this paper we show that any such theory can be turned into an…
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the meager ideal of the…
It is shown that any finitely generated subring of a global field has a universal first-order definition in its fraction field. This covers Koenigsmann's result for the ring of integers and its subsequent extensions to rings of integers in…
Many economic theory models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. We provide a principled framework for scaling results from such models by removing these finiteness…
We give an easy proof of the Bernstein-Lunts equivalence of ordinary and equivariant derived categories of Harish-Chandra modules. This proof requires no boundedness assumptions. In the appendix we collect some needed, but not completely…
Induction is typically formalized as a rule or axiom extension of the LK-calculus. While this extension of the sequent calculus is simple and elegant, proof transformation and analysis can be quite difficult. Theories with an induction…
It was proved that for any finite set of elements of a free product of residually finite groups such that no two of them belong to conjugate cyclic subgroups and each of them do not belong to a subgroup which is conjugate a to free factor…
Weinstein's[2] brilliant short proof of de Branges'[1] theorem can be made yet much shorter(modulo routine calculations), completely elementary (modulo L\"owner theory), self contained(no need for the esoteric Legendre polynomials' addition…
This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain $\vee$ within the scope of quantifiers. The disjuncts of these FOLDNFs are…
We propose a hybrid-dynamic first-order logic as a formal foundation for specifying and reasoning about reconfigurable systems. As the name suggests, the formalism we develop extends (many-sorted) first-order logic with features that are…
We give a simple new proof that regular languages defined by first-order sentences with no quantifier alteration can be defined by such sentences in which only regular atomic formulas appear. Earlier proofs of this fact relied on arguments…
G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…
The alternative version of Hamiltonian formalism for higher-derivative theories is proposed. As compared with the standard Ostrogradski approach it has the following advantages: (i) the Lagrangian, when expressed in terms of new variables…
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…
We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…
We show that ${\mathbb Z}$ is definable in ${\mathbb Q}$ by a universal first-order formula in the language of rings. We also present an $\forall\exists$-formula for ${\mathbb Z}$ in ${\mathbb Q}$ with just one universal quantifier. We…
The aim of this paper is to present a self contained introduction to the Hubbard model and some of its applications.The paper consists of two parts: the first will introduce the basic notions of the Hubbard model starting from the…