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

DOI10.1515/DMA-2013-0031MaRDI QIDQ2344091zbMATH OpenOpenAlexFDO

Authors S. 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 logicdefinability of functions and relationsKleene hierarchylanguage of functional equations

Mathematics Subject Classification ID

Many-valued logic (03B50)

Recommendations

• A note on definability in equational logic
• On the complexity of solutions of systems of functional equations in countable-valued logic
• Definability in functional analysis
• Definability in function spaces
• On equational definability of function classes
• scientific article; zbMATH DE number 515737
• Two Definability Results in the Equational Context
• scientific article; zbMATH DE number 1796130
• scientific article; zbMATH DE number 5235521

Cited in

(8)

• On FE-precomplete classes in countable-valued logic
• Definability in function spaces
• Action of an FE-closure operator on functions of countable-valued logic
• On alphabetic coding for superwords
• Functional equations for the functions of real variables
• On the complexity of solutions of systems of functional equations in countable-valued logic
• scientific article; zbMATH DE number 5235521 (Why is no real title available?)
• 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

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