Related papers: Infinite computable version of Lovasz Local Lemma
Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…
Computability logic is a formal theory of computational tasks and resources. Its formulas represent interactive computational problems, logical operators stand for operations on computational problems, and validity of a formula is…
Defeasible rules are used in providing computable representations of legal documents and, more recently, have been suggested as a basis for explainable AI. Such applications draw attention to the scalability of implementations. The…
The Local Computation Algorithm (LCA) model is a popular model in the field of sublinear-time algorithms that measures the complexity of an algorithm by the number of probes the algorithm makes in the neighborhood of one node to determine…
In this paper we provide a notion of causality for the violation of general Linear Temporal Logic (LTL) properties. The current work is a natural extension of the previously proposed approach handling causality in the context of…
The lasso is a popular tool for sparse linear regression, especially for problems in which the number of variables p exceeds the number of observations n. But when p>n, the lasso criterion is not strictly convex, and hence it may not have a…
Composite likelihoods are a class of alternatives to the full likelihood which are widely used in many situations in which the likelihood itself is intractable. A composite likelihood may be computed without the need to specify the full…
Quantum-mechanical observables for spatial and spacetime localization are considered from a lattice-theoretic perspective. It is shown that when replacing the lattice of all complex orthogonal projections underlying the Born rule by the…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
We introduce a new model-agnostic explanation technique which explains the prediction of any classifier called CLE. CLE gives an faithful and interpretable explanation to the prediction, by approximating the model locally using an…
Linear logic is a substructural logic proposed as a refinement of classical and intuitionistic logics, with applications in programming languages, game semantics, and quantum physics. We present a template for Gentzen-style linear logic…
A tiling is said to have infinite local complexity (ILC) if it contains infinitely many two-tile patches up to rigid motions. In this work, we provide examples of substitution rules that generate tilings with ILC. The proof relies on…
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…
This paper investigates the expressiveness of a fragment of first-order sentences in Gaifman normal form, namely the positive Boolean combinations of basic local sentences. We show that they match exactly the first-order sentences preserved…
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
We develop a topological approach to prove the generalized Lax conjecture using the fact that determinants of sufficiently big symmetric linear pencils are able to express the rigidly convex sets of RZ polynomials of any degree $d$.…
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…
The Muskat problem models the dynamics of the interface between two incompressible immiscible fluids with different constant densities. In this work we prove three results. First we prove an $L^2(\R)$ maximum principle, in the form of a new…
We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…