Related papers: Delta-Decidability over the Reals
Let $D$ be a smooth domain in $\mathbb{R}^N$, $N\geq 3$ and let $f$ be a positive continuous function on $\partial D$. Under some assumptions on $\varphi$, it is shown that the problem $\Delta u=2\varphi(u)$ in $D$ and $u=f$ on $\partial…
In paper describes the new logic programming language Delta, which have a many good properties. Delta-programs is p-computable, verifiable and can translation on other languages. Also we describe the Delta-methodology for constructing…
This thesis develops a framework for formalizing reasoning about specifications of systems written in LF. This formalization centers around the development of a reasoning logic that can express the sorts of properties which arise in…
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…
This paper is concerned with the study of diagonal Diophantine inequalities of fractional degree $ \theta ,$ where $ \theta >2$ is real and non-integral. For fixed non-zero real numbers $ \lambda_i $ not all of the same sign we write…
We prove that for any $\ell \geq 0$, there exists an algorithm which takes as input a description of a semi-algebraic subset $S \subset \mathbb{R}^k$ given by a quantifier-free first order formula $\phi$ in the language of the reals, and…
Due to the undecidability of most type-related properties of System F like type inhabitation or type checking, restricted polymorphic systems have been widely investigated (the most well-known being ML-polymorphism). In this paper we…
This paper from 2012 is the second in a series of three papers. All three papers deal with interpretability logics and related matters. In the first paper a construction method was exposed to obtain models of these logics. Using this…
We prove decidability results on the existence of constant subsequences of uniformly recurrent morphic sequences along arithmetic progressions. We use spectral properties of the subshifts they generate to give a first algorithm deciding…
The formal system $\lambda\delta$ is a typed lambda calculus derived from $\Lambda_\infty$, aiming to support the foundations of Mathematics that require an underlying theory of expressions (for example the Minimal Type Theory). The system…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation \beta, and a quaternary equidistance relation \equiv. Tarski established, inter alia, that the first-order…
In logics for the strategic reasoning the main challenge is represented by their verification in contexts of imperfect information and perfect recall. In this work, we show a technique to approximate the verification of Alternating-time…
We investigate a famous decision problem in automata theory: separation. Given a class of language C, the separation problem for C takes as input two regular languages and asks whether there exists a third one which belongs to C, includes…
It is well known that non-negative solutions to the Dirichlet problem $\Delta u =f$ in a bounded domain $\Omega$, where $f\in L^q(\Omega)$, $q>\frac{n}2$, satisfy $\|u\|_{L^\infty(\Omega)} \leq C\|f\|_{L^q(\Omega)}$. We generalize this…
The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…
We consider a seemingly weaker form of $\Delta^1_1$ Turing determinacy. Let $2 \leq \rho < \omega_1^{\textrm{CK}}$, $\textrm{Weak-Turing-Det}_\rho (\Delta^1_1)$ is the statement: Every $\Delta^1_1$ set of reals cofinal in the Turing degrees…