相关论文: A Naive Encoding of Russell's Paradox in Type Theo…
Let A be a finite or countable alphabet and let $\theta$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…
Some advantages of Cubical Type Theory, as implemented by Cubical Agda, over intensional Martin-L\"of Type Theory include Quotient Inductive Types (QITs), which exist as instances of Higher Inductive Types, and functional extensionality,…
We consider the problem of information-theoretic secrecy in identification schemes rather than transmission schemes. In identification, large identities are encoded into small challenges sent with the sole goal of allowing at the receiver…
A semantic analysis of formal systems is undertaken, wherein the duality of their symbolic definition based on the "State of Doing" and "State of Being" is brought out. We demonstrate that when these states are defined in a way that opposes…
Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…
In Martin-L\"of's Intensional Type Theory, identity type is a heavily used and studied concept. The reason for that is the fact that it's responsible for the recently discovered connection between Type Theory and Homotopy Theory. The main…
The diversity of the symbols of the information source is calculated following the definition that entropy is the information loss and following a new entropy-symbol similarity relation after the rejection of the Gibbs paradox statement.…
The article presents the detailed analysis of the watch paradox. It is shown that it arose because of unjustified, as it turned out, identification of watch readings at the moment of its return with the time read by it.
We examine complexity and versatility of five modulo 9 Kanade--Russell identities through their finite (aka polynomial) versions and images under the $q\mapsto1/q$ reflection.
According to Russell, strict uses of the definite article 'the' in a definite description 'the F' involve uniqueness; in case there is more than one F, 'the F' is used somewhat loosely, and an indefinite description 'an F' should be…
Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.
In the present paper, as we did previously in [7], we investigate the relations between the geometric properties of tilings and the algebraic properties of associated relational structures. Our study is motivated by the existence of…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
The clock paradox is analyzed for the case when the onward and return trips cover the same <<distance>> (as observed by the traveling twin) but at unequal velocities. In this case the stationary twin observes the distances covered by her…
We prove weak-strong uniqueness results for the isentropic compressible Navier-Stokes system on the torus. In other words, we give conditions on a strong solution so that it is unique in a class of weak solutions. Known weak-strong…
Native type systems are those in which type constructors are derived from term constructors, as well as the constructors of predicate logic and intuitionistic type theory. We present a method to construct native type systems for a broad…
I think we can agree that dealing with uncertainty is not easy. Probability is the main tool for dealing with uncertainty, and we know there are many probability-related puzzles and paradoxes. Here I describe a rather idiosyncratic…
In modern OCaml, single-argument datatype declarations (variants with a single constructor, records with a single field) can sometimes be `unboxed'. This means that their memory representation is the same as their single argument (omitting…
By Tzouvaras, a set is nontypical in the Russell sense, if it belongs to a countable ordinal definable set. The class HNT of all hereditarily nontypical sets satisfies all axioms of ZF and the double inclusion HOD$\subseteq$HNT$\subseteq$V…
Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…