Type 4 is not computable
Rings and Algebras
2009-09-25 v1
Authors:
Japheth Wood
Abstract
We extend a recent result of McKenzie, and show that it is an undecidable problem to determine if 4 appears in the typeset of a finitely generated, locally finite variety.
Cite
@article{arxiv.math/9611224,
title = {Type 4 is not computable},
author = {Japheth Wood},
journal= {arXiv preprint arXiv:math/9611224},
year = {2009}
}
Related papers
View all related →
Algebraic Geometry · Mathematics
On finite categories of algebraic varieties
Junho Peter Whang
2023-09-11
Group Theory · Mathematics
Computability of finite quotients of finitely generated groups
Emmanuel Rauzy
2021-10-27
Logic in Computer Science · Computer Science
On Decidable and Undecidable Extensions of Simply Typed Lambda Calculus
Naoki Kobayashi
2025-02-11
General Relativity and Quantum Cosmology · Physics
The world problem: on the computability of the topology of 4-manifolds
James R. van Meter
2007-05-23
Formal Languages and Automata Theory · Computer Science
Undecidability and Finite Automata
Jörg Endrullis, Jeffrey Shallit, Tim Smith
2017-03-01
Group Theory · Mathematics
The triviality problem for profinite completions
Martin R. Bridson, Henry Wilton
2023-07-19
Logic · Mathematics
Profiniteness in finitely generated varieties is undecidable
Anvar M. Nurakunov, Michał M. Stronkowski
2019-02-20
Logic · Mathematics
The Undecidability of the Definability of Principal Subcongruences
Matthew Moore
2019-06-07
Logic · Mathematics
Categoricity Properties for Computable Algebraic Fields
Denis Hirschfeldt, Ken Kramer, Russell Miller, Alexandra Shlapentokh
2018-02-12
Databases · Computer Science
Red Spider Meets a Rainworm: Conjunctive Query Finite Determinacy Is Undecidable
Tomasz Gogacz, Jerzy Marcinkowski
2015-12-08
Logic in Computer Science · Computer Science
A Type System for proving Depth Boundedness in the pi-calculus
Emanuele D'Osualdo, Luke Ong
2015-02-24
Logic · Mathematics
Definability of types over finite partial order indiscernibles
Vincent Guingona
2011-08-12
Logic · Mathematics
On the computability of ordered fields
M. V. Korovina, O. V. Kudinov
2020-11-18
Group Theory · Mathematics
Notes about decidability of exponential equations
Oleg Bogopolski, Aleksander Ivanov
2021-05-17
Algebraic Geometry · Mathematics
On the quotient of $\mathbb{C}^4$ by a finite primitive group of type (I)
Ilya Karzhemanov
2012-10-02
Group Theory · Mathematics
On the word problem for just infinite groups
Alexey Talambutsa
2026-03-30
Logic in Computer Science · Computer Science
Combining Inclusion Polymorphism and Parametric Polymorphism
Sabine Glesner, Karl Stroetmann
2007-05-23
Number Theory · Mathematics
Mixed quantifier prefixes over Diophantine equations with integer variables
Zhi-Wei Sun
2024-06-14
Logic · Mathematics
Undecidability of Finite Orbit Recognition in Polynomial Maps
Gwangyong Gwon
2026-05-19
Logic in Computer Science · Computer Science
What's Decidable about (Atomic) Polymorphism
Paolo Pistone, Luca Tranchini
2021-05-04
Group Theory · Mathematics
Undecidability and the developability of permutoids and rigid pseudogroups
Martin R. Bridson, Henry Wilton
2017-02-09
Databases · Computer Science
The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable
Tomasz Gogacz, Jerzy Marcinkowski
2015-12-08
Logic · Mathematics
Bounding essential arities of term operations in finitely decidable varieties
Matthew Smedberg
2013-11-13
Logic · Mathematics
Computing the exponent of a Lebesgue space
Timothy H. McNicholl
2020-01-01
Metric Geometry · Mathematics
There are no realizable 15_4- and 16_4-configurations
Juergen Bokowski, Lars Schewe
2008-01-16