Related papers: Realizability algebras III: some examples
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
We develop a notion of realizability for Classical Linear Logic based on a concurrent process calculus.
We present an imperative object calculus where types are annotated with qualifiers for aliasing and mutation control. There are two key novelties with respect to similar proposals. First, the type system is very expressive. Notably, it…
We survey some results that provide different versions of classical results through different summability methods. Specifically, in order to adapt such classical results, we analyze which properties should satisfy the summability methods.…
Model-checking is one of the most powerful techniques for verifying systems and programs, which since the pioneering results by Knapik et al., Ong, and Kobayashi, is known to be applicable to functional programs with higher-order types…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…
In this paper, we investigate hypergroups which arise from association schemes in a canonical way; this class of hypergroups is called realizable. We first study basic algebraic properties of realizable hypergroups. Then we prove that two…
We recently described a formalism for reasoning with if-then rules that re expressed with different levels of firmness [18]. The formalism interprets these rules as extreme conditional probability statements, specifying orders of magnitude…
We examine a new approach to modeling uncertainty based on plausibility measures, where a plausibility measure just associates with an event its plausibility, an element is some partially ordered set. This approach is easily seen to…
We extend Robust Optimization to fractional programming, where both the objective and the constraints contain uncertain parameters. Earlier work did not consider uncertainty in both the objective and the constraints, or did not use Robust…
Starting from an inaccessible cardinal, we construct a model of $ZF+DC$ where there exists a mad family and all sets of reals are $\mathbb Q$-measurable for $\omega^{\omega}$-bounding sufficiently absolute forcing notions $\mathbb Q$.
Despite the numerous advances, reinforcement learning remains away from widespread acceptance for autonomous controller design as compared to classical methods due to lack of ability to effectively tackle the reality gap. The reliance on…
A technique is introduced which allows to generate -- starting from any solvable discrete-time dynamical system involving N time-dependent variables -- new, generally nonlinear, generations of discrete-time dynamical systems, also involving…
We present realizability and realization logic, two program logics that jointly address the problem of finding solutions in semantics-guided synthesis. What is new is that we proceed eagerly and not only analyze a single candidate program…
We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability…
System Z+ [Goldszmidt and Pearl, 1991, Goldszmidt, 1992] is a formalism for reasoning with normality defaults of the form "typically if phi then + (with strength cf)" where 6 is a positive integer. The system has a critical shortcoming in…
We present a systematic study of the method of "norms on possibilities" of building forcing notions with keeping their properties under full control. This technique allows us to answer several open problems, but on our way to get the…
This survey (re)introduces reinforcement learning methods to economists. The curse of dimensionality limits how far exact dynamic programming can be effectively applied, forcing us to rely on suitably "small" problems or our ability to…
We have found a "non-purely-constructive" method of acquiring algebraic cycles involving multiple steps. This note tries to present the main idea in the last step by concentrating on an example of 4-folds. The method demonstrates a contrast…
We deal with relatives of GCH which are provable. In particular we deal with rank version of the revised GCH. Our motivation was to find such results when only weak versions of the axiom of choice are assumed but some of the results gives…