Logics that define their own semantics

DOI10.1007/S001530050135zbMath0931.03056OpenAlexW1989919258MaRDI QIDQ1818429

H. Imhof

Publication date: 28 February 2000

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001530050135

zbMATH Keywords

finite model theoryPTIMEcountable logics over finite vocabulariesmodel checking Turing machinesnesting hierarchies for generalized quantifiersrecursive logicsself definability

Mathematics Subject Classification ID

Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10) Abstract model theory (03C95)

This page was built for publication: Logics that define their own semantics