Related papers: On Non-standard Models of Arithmetic with Uncounta…
The notion of slicely countably determined (SCD) sets was introduced in 2010 by A.~Avil\'{e}s, V.~Kadets, M.~Mart\'{i}n, J.~Mer\'{i} and V.~Shepelska. We solve in the negative some natural questions about preserving being SCD by the…
There is a fascinating interplay and overlap between recursion theory and descriptive set theory. A particularly beautiful source of such interaction has been Martin's conjecture on Turing invariant functions. This longstanding open problem…
The theory of regular cost functions is a quantitative extension to the classical notion of regularity. A cost function associates to each input a non-negative integer value (or infinity), as opposed to languages which only associate to…
Cantor's first set theory paper (1874) establishes the uncountability of $\mathbb{R}$. We study this most basic mathematical fact formulated in the language of higher-order arithmetic. In particular, we investigate the logical and…
Satisfiability Testing (SAT) techniques are well-established in classical computing where they are used to solve a broad variety of problems, e.g., in the design of classical circuits and systems. Analogous to the classical realm, quantum…
Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…
Hereditarily finite sets (sets which are finite and have only hereditarily finite sets as members) are basic mathematical and computational objects, and also stand at the basis of some programming languages. This raises the need for…
We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…
Crawford's et al. (2021) article on estimation of discrete choice models with unobserved or latent consideration sets, presents a unified framework to address the problem in practice by using "sufficient sets", defined as a combination of…
Many AI-related reasoning problems are based on the problem of satisfiability of propositional formulas with some cardinality-minimality condition. While the complexity of the satisfiability problem (SAT) is well understood when considering…
In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…
We study the concept of canonical characteristic set of a characterizable differential ideal. We propose an efficient algorithm that transforms any characteristic set into the canonical one. We prove the basic properties of canonical…
In [8] the authors initiate the study of selective versions of the notion of $\theta$-separability in non-regular spaces. In this paper we continue this investigation by establishing connections between the familiar cardinal numbers arising…
This article is the second in a series of two presenting the Scale Relativistic approach to non-differentiability in mechanics and its relation to quantum mechanics. Here, we show Schroedinger's equation to be a reformulation of Newton's…
We investigate the end extendibility of models of arithmetic with restricted elementarity. By utilizing the restricted ultrapower construction in the second-order context, for each $n\in\mathbb{N}$ and any countable model of…
Scott continuity is a concept from domain theory that had an unexpected previous life in the theory of von Neumann algebras. Scott-continuous states are known as normal states, and normal states are exactly the states coming from density…
In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…
The problem of model counting, also known as #SAT, is to compute the number of models or satisfying assignments of a given Boolean formula $F$. Model counting is a fundamental problem in computer science with a wide range of applications.…
Science and mathematics help people to better understand world, eliminating many inconsistencies, fallacies and misconceptions. One of such misconceptions is related to arithmetic of natural numbers, which is extremely important both for…
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…