Search
Search Results
-
Effective weak and vague convergence of measures on the real line
We expand our effective framework for weak convergence of measures on the real line by showing that effective convergence in the Prokhorov metric is...
-
The Lattice of Definability: Origins, Recent Developments, and Further Directions
AbstractThis article presents results and open problems related to definability spaces (reducts) and sources of this field since the 19th century....
-
-
Dynamic Temporal Logical Operations in Multi-Agent Logics
We study temporal multi-agent logics using a new approach to defining time for individual agents. It is assumed that in any time state each agent (in...
-
Design and verification of pipelined circuits with Timed Petri Nets
A fundamental step in circuit design is the placement of pipeline stages, which can drastically increase the data throughput. Retiming allows...
-
Quantifier Elimination
A test for eliminating quantifiers is given and applied it to further study the model theory of algebraically closed fields.
-
Arithmetic
The standard model of arithmetic is the structure $$\mathfrak {N}= \langle \omega...
-
KNOWLEDGE ACQUISITION IN MULTI-AGENT SYSTEMS: A FORMALIZATION OF THE ELEUSIS CARD GAME
We deal with logical approaches to knowledge acquisition in multi-agent systems. We enhance previous work by considering the inductive card game...
-
Symmetry for Transfinite Computability
Finite Turing computation has a fundamental symmetry between inputs, outputs, programs, time, and storage space. Standard models of transfinite...
-
Compactness and Complete Theories
The Compactness theorem and some of its consequences are studied. The Upward Löwenheim–Skolem is proved and used to deduce Vaught’s result on the...
-
-
The additive structure of integers with the lower Wythoff sequence
We have provided a model-theoretic proof for the decidability of the additive structure of integers together with the function f map** x to
... -
Systems of Diophantine Equations over Finite Configurations
Under study are the finite systems of Diophantine equations over finite configurations. We propose some consistency verification procedure for such...
-
Algebraically Closed Fields
We establish a simple algebraic elimination of quantifiers procedure for the theory of algebraically closed fields. This theory is model complete...
-
Countable Nonstandard Models: Following Skolem’s Approach
In 1934, Skolem gave a remarkable construction of a countable nonstandard model of arithmetic. His construction contains ideas of the ultrapower...
-
-
Algorithms for Recognizing Restricted Interpolation over the Modal Logic S4
We consider the restricted interpolation property IPR in modal logics. Earlier, the decidability of IPR over the modal logic S4 was proved and a...
-
