Related papers: Isabelle/HOL/GST: A Formal Proof Environment for G…
A generalisation of Scott's information systems \cite{sco82} is presented that captures exactly all L-domains. The global consistency predicate in Scott's definition is relativised in such a way that there is a consistency predicate for…
Church's simple type theory is often deemed too simple for elaborate mathematical constructions. In particular, doubts were raised whether schemes could be formalized in this setting and a challenge was issued. Schemes are sophisticated…
Gradual semantics (GS) have demonstrated great potential in argumentation, in particular for deploying quantitative bipolar argumentation frameworks (QBAFs) in a number of real-world settings, from judgmental forecasting to explainable AI.…
We show that not every family of generalized microscopic sets forms an ideal. Moreover, we prove that some of these families have some weaker additivity properties and some of them do not have even that.
The Giry monad on the category of measurable spaces restricts to the full subcategory of standard Borel spaces, $\mathbf{Std}$, which we show is amenable to analysis. $\mathbf{Std}$ contains the space $\mathbb{R}_{\infty}$ which is the…
A generalized non-Hermitian oscillator Hamiltonian is proposed that consists of additional linear terms which break PT-symmetry explicitly. The model is put into an equivalent Hermitian form by means of a similarity transformation and the…
There have recently been several developments in synthetic mathematics using extensions of dependent type theory with univalence and higher inductive types: simplicial homotopy type theory, synthetic algebraic geometry and synthetic Stone…
This paper contains analysis of creation of sets and multisets as an approach for modeling of some aspects of human thinking. The creation of sets is considered within constructive object-oriented version of set theory (COOST), from…
Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…
We construct GLSM invariants for a general choice of stability in both the narrow and broad sector cases and prove they form a Cohomological Field Theory. This is obtained by forming the analogue of a virtual fundamental class which lives…
We present an executable formally verified SAT encoding of classical AI planning. We use the theorem prover Isabelle/HOL to perform the verification. We experimentally test the verified encoding and show that it can be used for reasonably…
We describe a procedure for determining the generalised scaling functions $f_n(g)$ at all the values of the coupling constant. These functions describe the high spin contribution to the anomalous dimension of large twist operators (in the…
Answer Set Programming (ASP) is logic programming under the stable model or answer set semantics. During the last decade, this paradigm has seen several extensions by generalizing the notion of atom used in these programs. Among these,…
Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…
We introduce the notion of set-decomposition of a normal G-flat chain. We show that any normal rectifiable $G$-flat chain admits a decomposition in set-indecomposable sub-chains. This generalizes the decomposition of sets of finite…
Isabelle is a generic theorem prover with a fragment of higher-order logic as a metalogic for defining object logics. Isabelle also provides proof terms. We formalize this metalogic and the language of proof terms in Isabelle/HOL, define an…
These are a set of lecture notes on generalized global symmetries in quantum field theory. The focus is on invertible symmetries with a few comments regarding non-invertible symmetries. The main topics covered are the basics of higher-form…
The process of cognition is analysed to adjust the set theory to physical description. Postulates and basic definitions are revised. The specific sets of predicates, called presets, corresponding to the physical objects identified by an…
Many mathematical objects can be represented as functors from finitely-presented categories $\mathsf{C}$ to $\mathsf{Set}$. For instance, graphs are functors to $\mathsf{Set}$ from the category with two parallel arrows. Such functors are…
This paper presents in detail the generalized pignistic transformation (GPT) succinctly developed in the Dezert-Smarandache Theory (DSmT) framework as a tool for decision process. The GPT allows to provide a subjective probability measure…