« first day (3574 days earlier)      last day (316 days later) » 

Martin Sleziak
Martin Sleziak
5:49 AM
3
Q: Complexity of |a| < |b| for ordinal notations?

Peter GerdesWhat is the complexity (e.g. is it $\Sigma^0_1$, arithmetic, fully $\Pi^1_1$) of the relation $|a| < |b|$ given two notations $a, b \in \mathscr{O}$ (Kleene's O)? What about the case where only one of the notations must be in $\mathscr{O}$ (where $b \not\in \mathscr{O} \implies |b| = \infty$)? Fo...

lo.logic computability-theory descriptive-set-theory recursive-ordinals
0
Q: Is a principal filter in a free Heyting algebra a projective Heyting algebra?

TriA Heyting algebra is a bounded distributive lattice $(L,\vee,\wedge,0,1)$ together with a binary operation $\rightarrow$ called implication or relative pseudocomplementation with the property that, for all $x,y,z\in L$, $$ x\le y\rightarrow z\quad\text{ if and only if } x\wedge y\le z. $$ Boolean...

lattice-theory heyting-algebra
Heyting algebra
In mathematics, a Heyting algebra (also known as pseudo-Boolean algebra) is a bounded lattice (with join and meet operations written ∨ and ∧ and with least element 0 and greatest element 1) equipped with a binary operation a → b of implication such that (c ∧ a) ≤ b is equivalent to c ≤ (a → b). From a logical standpoint, A → B is by this definition the weakest proposition for which modus ponens, the inference rule A → B, A ⊢ B, is sound. Like Boolean algebras, Heyting algebras form a variety axiomatizable with finitely many equations. Heyting algebras were introduced by Arend Heyting (1930) to...
 

« first day (3574 days earlier)      last day (316 days later) »