Definability in the language of functional equations of a countable-valued logic

DOI10.1515/DMA-2013-0031zbMath1312.03025OpenAlexW2320742158MaRDI QIDQ2344091

Sergey S. Marchenkov

Publication date: 12 May 2015

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2013-0031

zbMATH Keywords

countable-valued logicKleene hierarchydefinability of functions and relationslanguage of functional equations

Mathematics Subject Classification ID

Many-valued logic (03B50)

Related Items (3)

On FE-precomplete classes in countable-valued logic ⋮ On alphabetic coding for superwords ⋮ On complexity of problem of satisfiability for systems of countable-valued functional equations

This page was built for publication: Definability in the language of functional equations of a countable-valued logic