A remark on a paper of I. V. Latkin

DOI10.1007/S10469-013-9256-3zbMATH Open1337.03058OpenAlexW2145921004MaRDI QIDQ893086FDOQ893086

Authors: M. N. Leont'eva 

Publication date: 13 November 2015

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-013-9256-3

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Undecidability and degrees of sets of sentences (03D35)

Cites Work

• Recognition complexity of theories and their computational expressivity

Cited In (2)

• Some facts related to the papers by L. V. Kantorovich reproduced in this issue
• Title not available (Why is that?)

This page was built for publication: A remark on a paper of I. V. Latkin

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893086)