Related papers: Infinite computable version of Lovasz Local Lemma

A composite likelihood is an inference function derived by multiplying a set of likelihood components. This approach provides a flexible framework for drawing inference when the likelihood function of a statistical model is computationally…

We prove a lemma, which we call the Order Ideal Lemma, that can be used to demonstrate a wide array of log-concavity and log-convexity results in a combinatorial manner using order ideals in distributive lattices. We use the Order Ideal…

The profusion of knowledge encoded in large language models (LLMs) and their ability to apply this knowledge zero-shot in a range of settings makes them promising candidates for use in decision-making. However, they are currently limited by…

In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…

Propositional Typicality Logic (PTL) is a recently proposed logic, obtained by enriching classical propositional logic with a typicality operator capturing the most typical (alias normal or conventional) situations in which a given sentence…

In contexts in which the principle of dependent choice may not be available, as toposes or Constructive Set Theory, standard locale theoretic results related to complete regularity may fail to hold. To resolve this difficulty, B.…

Mittag-Leffler modules occur naturally in algebra, algebraic geometry, and model theory, [18], [12], [17]. If $R$ is a non-right perfect ring, then it is known that in contrast with the classes of all projective and flat modules, the class…

Partial penalized tests provide flexible approaches to testing linear hypotheses in high dimensional generalized linear models. However, because the estimators used in these tests are local minimizers of potentially non-convex…

In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or…

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible…

This paper discusses limitations of reflexive and diagonal arguments as methods of proof of limitative theorems (e.g. G\"odel's theorem on Entscheidungsproblem, Turing's halting problem or Chaitin-G\"odel's theorem). The fact, that a formal…

It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…

If the log likelihood is approximately quadratic with constant Hessian, then the maximum likelihood estimator (MLE) is approximately normally distributed. No other assumptions are required. We do not need independent and identically…

The Ghahramani-Lau conjecture is established; in other words, the measure algebra of every locally compact group is strongly Arens irregular. To this end, we introduce and study certain new classes of measures (called approximately…

Some notions in mathematics can be considered relative. Relative is a term used to denote when the variation in the position of an observer implies variation in properties or measures on the observed object. We know, from Skolem theorem,…

In this article we investigate which compact spaces remain compact under countably closed forcing. We prove that, assuming the Continuum Hypothesis, the natural generalizations to $\omega_1$-sequences of the selection principle and…

In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional…

Lov\'asz gave a short proof of Brooks' theorem by coloring greedily in a good order. We give a different short proof by reducing to the cubic case. Then we show how to extend the result to (online) list coloring via the Kernel Lemma.

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…