Related papers: Continuous logic in a classical setting
We construct a universal continuous invariant bilinear form for the Lie algebra of compactly supported sections of a Lie algebra bundle in a topological sense. Moreover we construct a universal continuous central extension of a current…
Interactive theorem provers based on dependent type theory have the flexibility to support both constructive and classical reasoning. Constructive reasoning is supported natively by dependent type theory and classical reasoning is typically…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
In this paper, we consider a model of classical linear logic based on coherence spaces endowed with a notion of totality. If we restrict ourselves to total objects, each coherence space can be regarded as a uniform space and each linear map…
We prove a Model Existence Theorem for a fully infinitary logic for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson and…
We deal with stability theory for ``reasonable'' non-elementary classes without any remanents of compactness (like: above Hanf number or definable by L_{omega_1, omega}).
We prove that, any problem of minimization of proper lower semicontinuous function defined on a normal Hausdorff space, is canonically equivalent to a problem of minimization of a proper weak * lower semicontinuous convex function defined…
Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
Logical relations constitute a key method for reasoning about contextual equivalence of programs in higher-order languages. They are usually developed on a per-case basis, with a new theory required for each variation of the language or of…
A uniform approach to computing with infinite objects like real numbers, tuples of these, compacts sets, and uniformly continuous maps is presented. In work of Berger it was shown how to extract certified algorithms working with the signed…
In the language of $L^\infty$-modules proposed by Gigli, we introduce a first order calculus on a topological Lusin measure space $(M,\mathfrak{m})$ carrying a quasi-regular, strongly local Dirichlet form $\mathscr{E}$. Furthermore, we…
The article demonstrates that logic is not necessarily singleton and does not always have the standard interpretation of negation. Appropriate generalizations of logic are suggested. Positive logic and multivalued negation operations are…
Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…
An important consequence of the Hahn-Banach Theorem says that on any locally convex Hausdorff topological space $X$, there are sufficiently many continuous linear functionals to separate points of $X$. In the paper, we establish a `local'…
We define a class of rational numbers including, as a particular case, the classical harmonic numbers. For one particular instance we apply it to the expansion into powers series of a special function, and also detail its relashionship with…
Given a compact metric space X and a unital C*-algebra A, we introduce a family of seminorms on the C*-algebra of continuous functions from X to A, denoted C(X, A), induced by classical Lipschitz seminorms that produce compact quantum…
An explicit Lorentz covariant formulation of the canonical theory for classical fields is established on a space-like hypersurface. Hamilton's equations and a Poisson bracket are defined on the space-like hypersurface. The Poisson bracket…
This paper enlarges classical syllogistic logic with assertions having to do with comparisons between the sizes of sets. So it concerns a logical system whose sentences are of the following forms: {\sf All $x$ are $y$} and {\sf Some $x$ are…
Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…