Related papers: Glivenko's theorems from an ecumenical perspective
We consider "randomized" statistics constructed by using a finite number of observations a random field at randomly chosen points. We generalize the invariance principle (the functional CLT), the Glivenko--Cantelli theorem, the theorem…
This paper establishes and proves representation theorems for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. Cumulative logics are famously given by System C. For propositional…
We present a logical framework for formalizing connections between finitary combinatorics and measure theory or ergodic theory that have appeared various places throughout the literature. We develop the basic syntax and semantics of this…
This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…
We introduce the notion of a rational dynamical system extending the classical notion of a topological dynamical system and we prove (multiple) recurrence results for such systems via a partition theorem for the rational numbers proved by…
In this paper we discuss the connections between a Vlasov-Fokker-Planck equation and an underlying microscopic particle system, and we interpret those connections in the context of the GENERIC framework (\"Ottinger 2005). This…
Cyclic proof theory studies proofs where cycles are allowed. This is useful for developing proof theory for logics with fixpoint operators: cycles can be used to represent the unfolding of a fixpoint. However, this cyclic character is not…
In this article we have illustrated how is possible to formulate Maxwell's equations in vacuum in an independent form of the usual systems of units. Maxwell's equations, are then specialized to the most commonly used systems of units:…
In [1], systems of weakening of intuitionistic negation logic called Z_n and CZ_n were developed in the spirit of da Costa's approach(c.f. [2]) by preserving, differently from da Costa, its fundamental properties: antitonicity, inversion…
We present a non-commutative version of the cycle lemma of Dvoretsky and Motzkin that applies to free groups and use this result to solve a number of problems involving cyclic reduction in the free group. We also describe an application to…
We give a parametrization with perfect sets of the abstract Ellentuck theorem. The main tool for achieving this goal is a sort of parametrization of an abstract version of the Nash-Williams theorem. As corollaries, we obtain some known…
Unexpectedness is a central concept in Simplicity Theory, a theory of cognition relating various inferential processes to the computation of Kolmogorov complexities, rather than probabilities. Its predictive power has been confirmed by…
Theorems from universal algebra such as that of Murski\u{i} from the 1970s have a striking similarity to universal approximation results for neural nets along the lines of Cybenko's from the 1980s. We consider here a discrete analogue of…
In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…
Intuitionistic conditional logic, studied by Weiss, Ciardelli and Liu, and Olkhovikov, aims at providing a constructive analysis of conditional reasoning. In this framework, the would and the might conditional operators are no longer…
We study a simplified inertial Ericksen-Leslie system for the nematic liquid crystal flow, which can be viewed as a system coupling Navier-Stokes equations and wave map equations. We prove the global existence of classical solution with…
This paper explores proof-theoretic semantics, a formal approach to inferential semantics. It derives sentence meaning from formalized proofs, building upon Gentzen and Prawitz's work. The study addresses challenges in understanding how…
We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method. Our systems are more natural than Valentini's…
A set of brackets for classical dissipative systems, subject to external random forces, are derived. The method is inspired to the old procedure found by Peierls, for deriving the canonical brackets of conservative systems, starting from an…
We work within the framework of the Alpha-Theory introduced by Benci and Di Nasso. The Alpha-Theory postulates a few natural properties for an infinite "ideal" number $\alpha$. The formulation provides an elementary axiomatics for the…