scientific article; zbMATH DE number 3316934
From MaRDI portal
Publication:5596792
Cited in
(52)- On the classification of (effective) \(\varphi \)-spaces
- Undecidability of theories of Boolean algebras with selected ideals
- Varieties with decidable finite algebras. I: Linearity
- Prevarieties of associative rings whose elementary theory is decidable
- Elementary equivalence of topological spaces
- The completeness of Peano multiplication
- Reduced products which are not saturated
- Automorphism groups of ultrafilters
- Strongly constructive models and numerations of the Boolean algebra of recursive sets
- Ultraproducts and elementary types of some groups related to infinite symmetric groups
- Restricted theories of constructive Boolean algebras
- Theories of Boolean algebras in a calculus with the quantifier infinitely many exist
- Model theoretic properties in the variety generated by a primal algebra
- Elementary regular rings
- Degrees of autostability for prime Boolean algebras
- Tarski-type problems for free associative algebras
- What does a group algebra of a free group ``know about the group?
- Decidable locally finite discriminator varieties arising from dihedral varieties of groups
- On subsystems of reduced powers
- Automorphisms of Boolean algebras definable by fixed elements
- Strong constructivizability of Boolean algebras of elementary characteristic \((\infty, 0, 0)\)
- Autostability spectra for Boolean algebras
- Degrees of autostability relative to strong constructivizations for Boolean algebras
- Boolean algebras, Tarski invariants, and index sets
- Boolean algebras with a category theory in a weak second order logic
- Caper
- Prime model with no degree of autostability relative to strong constructivizations
- Decidable Discriminator Varieties from Unary Classes
- Decidability of second-order theories and automata on infinite trees
- scientific article; zbMATH DE number 3550696 (Why is no real title available?)
- The minimality of certain decidability conditions for Boolean algebras
- Recursively enumerable sets and degrees
- Sheaf Constructions and Their Elementary Properties
- On the Lattice of Recursively Enumerable Sets
- The Undecidability of the Word Problems for Projective Geometries and Modular Lattices
- The index set of Boolean algebras autostable relative to strong constructivizations
- Autostability relative to strong constructivizations of Boolean algebras with distinguished ideals
- Finitely-axiomatizable superatomic Boolean algebras with distinguished dense subalgebra of finite width
- Valued modules on skew polynomial rings and Bézout domains
- Reduced products, Horn sentences, and decision problems
- Invariants, Boolean algebras and ACA₀⁺
- The subset relation and 2‐stratified sentences in set theory and class theory
- Complexity of the problem of being equivalent to Horn formulas. II
- Boolean algebras of elementary characteristic \((1, 0, 1)\) whose set of atoms and Ershov-Tarski ideal are computable
- Local and nonvanishing superatomic Boolean algebras with a distinguished dense subalgebra
- Isomorphism of atomless Boolean algebras with distinguished ideals
- What is nominalistic mereology?
- Computably categorical Boolean algebras enriched by ideals and atoms
- Undecidability of the theory of Boolean algebras with automorphism
- Countable homogeneous Boolean algebras
- Decidable theories of non-projectable l-groups of continuous functions
- A uniform method for proving lower bounds on the computational complexity of logical theories
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5596792)
