Feasibly categorical models

DOI10.1007/3-540-60178-3_91OpenAlexW187439451MaRDI QIDQ6064288

Jeffery B. Remmel, Douglas Cenzer

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3_91

zbMATH Keywords

polynomial timeexponential timerecursive modelstandard universefixed integer

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Complexity-theoretic algebra. II: Boolean algebras
• Autostability of models
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Recursively presented games and strategies
• Autostability and computable families of constructivizations
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Recursively Categorical Linear Orderings
• Feasible Graphs and Colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Feasibly categorical models