scientific article; zbMATH DE number 4012568

zbMATH Open0624.03008MaRDI QIDQ3762283FDOQ3762283

Authors: Michail R. Tetruashvili 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 4152340
• scientific article; zbMATH DE number 845472
• scientific article; zbMATH DE number 23190
• scientific article; zbMATH DE number 892081
• Decision procedures for elementary sublanguages of set theory: XIII. Model graphs, reflection and decidability

zbMATH Keywords

Turing machinequantifier-free set theorytruth problem

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Set theory (03E99)

Cited In (3)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the complexity of identifying head-elementary-set-free programs

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 Q3762283)