Related papers: Constructive Combinatorics of Dickson's Lemma
Crispin Wright in his 1982 paper argues for strict finitism, a constructive standpoint that is more restrictive than intuitionism. In its appendix, he proposes models of strict finitistic arithmetic. They are tree-like structures, formed in…
In this paper we will develop an axiomatic foundation for the geometric study of straight edge, protractor, and compass constructions, which while being related to previous foundations, will be the first to have all axioms written and all…
We present a new method, the Subdivision Construction, for proving the finite model property (the fmp) for broad classes of modal logics and modal rule systems. The construction builds on the framework of stable canonical rules, and…
The constructive approach to mathematics has the advantage that witnesses can be extracted from statements of existence and theorems can be unwound to give algorithms. Even better, constructive theorems can be interpreted in any topos,…
Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…
In this review article the construction of first order coordinate differential calculi on finitely generated and finitely related associative algebras are considered and explicit construction of the bimodule of one form over such algebras…
In this paper we consider Kakutani's extension of the Brouwer fixed point theorem within the framework of Bishop's constructive mathematics. Kakutani's fixed point theorem is classically equivalent to Brouwer's fixed point theorem. The…
The semantic paradoxes are associated with self-reference or referential circularity. However, there are infinitary versions of the paradoxes, such as Yablo's paradox, that do not involve this form of circularity. It remains an open…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We consider strong combinatorial principles for sigma-directed families of countable sets in the ordering by inclusion modulo finite, e.g. P-ideals of countable sets. We try for principles as strong as possible while remaining compatible…
In the first part of the paper, some extensions of the classical Dynkin-Specht-Wever lemma are developed. In the second part, we extend Burgunder's splitting construction, and relate back to the Kashiwara-Vergne problem.
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
Our central observation is that unbounded additive recurrence establishes a homomorphism between $\mathbb{N}$ and Modus Ponens in a constructive sense. By finding sums of nonconsecutive Fibonacci indices, each inference step corresponds to…
We develop an obstruction theory for Hirsch extensions of cbba's with twisted coefficients. This leads to a variety of applications, including a structural theorem for minimal cbba's, a construction of relative minimal models with twisted…
Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connectives, which include two primitive intuitionistic implications.…
We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random"…
The book "A Course in Constructive Algebra" (1988) shows the way of understanding classical basic algebra in a constructive style similar to Bishop's Constructive Mathematics. Classical theorems are revisited, with a new flavour, and become…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
An example is given of a UFD which has infinitely generated Derksen invariant. The ring is \textquotedblleft almost rigid\textquotedblright\ meaning that the Derksen invariant is equal to the Makar-Limanov invariant. Techniques to show that…
The compactness lemma in programming language theory states that any recursive function can be simulated by a finite unrolling of the function. One important use case it has is in the logical relations proof technique for proving properties…