We present two masked priming lexical decision experiments in which we examined whether a nonword prime word would activate associative/semantic information from its corresponding addition neighbor (e.g., lght-dark via the addition neighbor light), producing associative/semantic priming. The rationale was the following: If a nonword prime with a missing letter produced a semantic/associative pr...

Abstract We investigate the uniform computational content of open and clopen Ramsey theorems in Weihrauch lattice. While they are known to be equivalent $\mathrm {ATR_0}$ from point view reverse mathematics, there is not a canonical way phrase them as multivalued functions. identify eight different functions (five corresponding theorem three theorem) study their degree Weihrauch, strong arithme...

We report on a proof-checked version of Stone’s result on the representability of Boolean algebras via the clopen sets of a totally disconnected compact Hausdor↵ space. Our experiment is based on a proof verifier based on set theory, whose usability can in its turn benefit from fully formalized proofs of representation theorems akin to the one discussed in this note.

Let G be a closed subgroup of S∞ and X be a Polish G-space with a countable basisA of clopen sets. Each x ∈ X defines a characteristic function τx on A by τx(A) = 1 ⇔ x ∈ A. We consider computable complexity of τx and some related questions.

in this paper, our purpose is twofold. firstly, the tensor andresiduum operations on $l-$nested systems are introduced under thecondition of complete residuated lattice. then we show that$l-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. thus the new representation theorem of$l-$subsets on complete re...