Related papers: Enayat Theories
When we work with information from multiple sources, the formalism each employs to handle uncertainty may not be uniform. In order to be able to combine these knowledge bases of different formats, we need to first establish a common basis…
We study the systems of ordinary differential equations which are implicit with respect to the higher derivatives, appearing in the linear form, and their solutions near the singular points. The invertibility of the higher derivatives…
We study semi-dynamical systems associated to delay differential equations. We give a simple criteria to obtain weak and strong persistence and provide sufficient conditions to guarantee uniform persistence. Moreover, we show the existence…
The Levy-Steinitz theorem characterizes the values that a conditionally convergent sequence in of real numbers can attain under permutations. We extend this analysis to sequences of countable sequences of real numbers, under pointwise…
The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…
We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…
We develop an axiomatic set theory -- the Theory of Hyperfinite Sets THS, which is based on the idea of existence of proper subclasses of big finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…
In a recent paper Kent has pointed out that in consistent histories quantum theory it is possible, given initial and final states, to construct two different consistent families of histories, in each of which there is a proposition that can…
We exploit a new theory of duality transformations to construct dual representations of models incompatible with traditional duality transformations. Hence we obtain a solution to the long-standing problem of non-Abelian dualities that…
The article provides a modest survey of the absolute theory of general systems of (partial) differential equations. The equations are relieved of all additional structures and subject to quite arbitrary change of the variables. An abstract…
Best possible bounds are established for families without s pairwise disjoint members and the more general problem for several families. The results are shown to apply several classical results.
Tarski's undefinability theorem states that a formal system based on conventional predicate logic (PL) cannot talk about its own truth predicate. PL is, however, not the only formal language imaginable. In this paper, it will be shown that…
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a…
In this note, we study the existence and uniqueness of a positive solution to a doubly singular fractional problem with nonregular data. Besides, for some cases, we will show the existence and uniqueness of another notion of a solution,…
Bifurcation theory and continuation methods are well-established tools for the analysis of nonlinear mechanical systems subject to periodic forcing. We illustrate the added value and the complementary information provided by singularity…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…
Coherence theorems for covariant structures carried by a category have traditionally relied on the underlying term rewriting system of the structure being terminating and confluent. While this holds in a variety of cases, it is not a…
We study the topological triviality and the Whitney equisingularity of a family of isolated determinantal singularities. On one hand, we give a L\^e-Ramanujam type theorem for this kind of singularities by using the vanishing Euler…