English
Related papers

Related papers: On a quasi-ordering on Boolean functions

200 papers

Higher-order probabilistic programming languages allow programmers to write sophisticated models in machine learning and statistics in a succinct and structured way, but step outside the standard measure-theoretic formalization of…

Programming Languages · Computer Science 2020-12-03 Chris Heunen , Ohad Kammar , Sam Staton , Hongseok Yang

In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly $13$ such structures up to first order interdefinability.

Logic · Mathematics 2020-02-06 Bertalan Bodor , Kende Kalina , Csaba Szabó

We classify the Boolean degree $1$ functions of $k$-spaces in a vector space of dimension $n$ (also known as Cameron-Liebler classes) over the field with $q$ elements for $n \geq n_0(k, q)$. This also implies that two-intersecting sets with…

Combinatorics · Mathematics 2024-05-28 Ferdinand Ihringer

Examples of discontinuous functions already appear in the work of Euler, Abel, Dirichlet, Fourier, and Bolzano. A ground-breaking discovery due to Baire was that many discontinuous functions are well-behaved in that they are the pointwise…

Logic · Mathematics 2026-02-06 Dag Normann , Sam Sanders

We prove density of smooth functions in subspaces of Sobolev- and higher order $BV$-spaces of kind $W^{m,p}(\Omega)\cap L^q(\Omega-D)$ and $BV^m(\Omega)\cap L^q(\Omega-D)$, respectively, where $\Omega\subset\mathbb{R}^n$ ($n\in\mathbb{N}$)…

Analysis of PDEs · Mathematics 2018-03-28 Jan Mueller

We study higher order quantum maps in the context of a *-autonomous category of affine subspaces. We show that types of higher order maps can be identified with certain Boolean functions that we call type functions. By an extension of this…

Quantum Physics · Physics 2026-05-06 Anna Jenčová

Using Koszmider's strongly unbounded functions, we show the following consistency result: Suppose that $\kappa,\lambda$ are infinite cardinals such that $\kappa^{+++} \leq \lambda$, $\kappa^{<\kappa}=\kappa$ and $2^{\kappa}= \kappa^+$, and…

Logic · Mathematics 2015-03-17 Juan Carlos Martinez , Lajos Soukup

We give complete, finite quasiequational axiomatisations for algebras of unary partial functions under the operations of composition, domain, antidomain, range and intersection. This completes the extensive programme of classifying algebras…

Logic · Mathematics 2014-10-16 Robin Hirsch , Marcel Jackson , Szabolcs Mikulás

It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (CABA's) taking a set to its power-set and, reciprocally, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a…

Category Theory · Mathematics 2022-09-20 Marcelo E. Coniglio , Guilherme V. Toledo

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

Combinatorics · Mathematics 2007-05-23 S. Corteel , C. D. Savage

The following representation theorem is proven: A partially ordered commutative ring $R$ is a subring of a ring of almost everywhere defined continuous real-valued functions on a compact Hausdorff space $X$ if and only if $R$ is archimedean…

Rings and Algebras · Mathematics 2024-10-10 Matthias Schötz

Let $k$ be a field of characteristic $0$, let $\mathsf{C}$ be a finite split category, let $\alpha$ be a 2-cocycle of $\mathsf{C}$ with values in the multiplicative group of $k$, and consider the resulting twisted category algebra…

Representation Theory · Mathematics 2014-05-06 Robert Boltje , Susanne Danz

We study sequences of functions of the form F_p^n -> {0,1} for varying n, and define a notion of convergence based on the induced distributions from restricting the functions to a random affine subspace. Using a decomposition theorem and a…

Combinatorics · Mathematics 2013-08-20 Hamed Hatami , Pooya Hatami , James Hirst

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and…

Data Structures and Algorithms · Computer Science 2013-04-19 Nikhil R. Devanur , Shaddin Dughmi , Roy Schwartz , Ankit Sharma , Mohit Singh

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…

Logic · Mathematics 2010-08-18 Daniel J. Miller

Consider the following curious puzzle: call an n-tuple X=(X_1, ..., X_n) of sets smaller than another n-tuple Y if it has fewer //unordered sections//. We show that equivalence classes for this preorder are very easy to describe and…

Combinatorics · Mathematics 2014-04-02 Pierre Hyvernat

We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…

Logic · Mathematics 2017-09-26 Milos S. Kurilic

Whenever the defining sequence of a Carleman ultraholomorphic class (in the sense of H. Komatsu) is strongly regular and associated with a proximate order, flat functions are constructed in the class on sectors of optimal opening. As…

Complex Variables · Mathematics 2014-02-12 Javier Sanz

We study different definitions of Sobolev spaces on quasiopen sets in a complete metric space equipped with a doubling measure supporting a p-Poincar\'e inequality with 1<p<\infty, and connect them to the Sobolev theory in R^n. In…

Analysis of PDEs · Mathematics 2017-02-13 Anders Björn , Jana Björn , Visa Latvala

The number of quantifiers needed to express first-order (FO) properties is captured by two-player combinatorial games called multi-structural games. We analyze these games on binary strings with an ordering relation, using a technique we…

Logic in Computer Science · Computer Science 2025-08-01 Marco Carmosino , Ronald Fagin , Neil Immerman , Phokion Kolaitis , Jonathan Lenchner , Rik Sengupta