Related papers: BDDs Naturally Represent Boolean Functions, and ZD…
A d.c. (delta-convex) function on a normed linear space is a function representable as a difference of two continuous convex functions. We show that an infinite dimensional analogue of Hartman's theorem on stability of d.c. functions under…
Verifying and explaining the behavior of neural networks is becoming increasingly important, especially when they are deployed in safety-critical applications. In this paper, we study verification problems for Binarized Neural Networks…
We study a natural measurable selection problem for which the standard uniformisation theorems do not seem to apply directly, yet a Borel selector exists. More precisely, we consider families of finite dimensional functions that admit…
Building meaningful representations of noun compounds is not trivial since many of them scarcely appear in the corpus. To that end, composition functions approximate the distributional representation of a noun compound by combining its…
In this paper, we unify the study of classical and non-classical algebra-valued models of set theory, by studying variations of the interpretation functions for identity and set-membership. Although, these variations coincide with the…
Functional decision theory (FDT) is a fairly new mode of decision theory and a normative viewpoint on how an agent should maximize expected utility. The current standard in decision theory and computer science is causal decision theory…
Anomaly detection is a challenging problem in machine learning, and is even more so when dealing with instances that are captured in low-level, raw data representations without a well-behaved set of engineered features. The Radial Basis…
ZFC has sentences that quantify over all sets or all ordinals, without restriction. Some have argued that sentences of this kind lack a determinate meaning. We propose a set theory called TOPS, using Natural Deduction, that avoids this…
This paper introduces the study of occurrence of symmetries in binary differential equations (BDEs). These are implicit differential equations given by the zeros of a quadratic 1-form, $a(x,y)dy^2 + b(x,y)dxdy + c(x,y)dx^2 = 0,$ for $a, b,…
Different Boolean networks may reveal similar dynamics although their definition differs, then preventing their distinction from the observations. This raises the question about the sufficiency of a particular Boolean network for properly…
First, the topological structure of a transition system is studied. Then, two types of transition system (TS) representations of Boolean networks (BNs) and Boolean control networks (BCNs) are investigated. The first kind of representation…
Polynomial threshold gates are basic processing units of an artificial neural network. When the input vectors are binary vectors, these gates correspond to Boolean functions and can be analyzed via their polynomial representations. In…
Evolutionary models on graphs, as an extension of the Moran process, have two major implementations: birth-death (BD) models (or the invasion process) and death- birth (DB) models (or voter models). The isothermal theorem states that the…
Inspired by the work of Izakhian and Rhodes, a theory of representation of hereditary collections by boolean matrices is developed. This corresponds to representation by finite $\vee$-generated lattices. The lattice of flats, defined for…
This paper concerns Boolean satisfiability (SAT) solvers based on Ordered Binary Decision Diagrams (BDDs), especially those that can generate proofs of unsatisfiability. Mengel (arXiv:2306.00886) has presented a theoretical analysis that a…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
It is shown that B\"acklund transformations (BTs) and zero-curvature representations (ZCRs) of systems of partial differential equations (PDEs) are closely related. The connection is established by nonlinear representations of the symmetry…
A boolean term order is a total order on subsets of [n]={1,...,n} such that \emptyset < alpha for all nonempty alpha contained in [n], and alpha < beta implies alpha \cup gamma < beta \cup gamma for all gamma which do not intersect alpha or…
We study several bialgebraic structures on boolean functions, that is to say maps defined on the set of subsets of a finite set $X$, taking the value $0$ on $\emptyset$. Examples of boolean functions are given by the indicator function of…
A logical function can be used to characterizing a property of a state of Boolean network (BN), which is considered as an aggregation of states. To illustrate the dynamics of a set of logical functions, which characterize our concerned…