New Computational Paradigms

DOI10.1007/B136981zbMATH Open1115.03023OpenAlexW2278484831MaRDI QIDQ5717062FDOQ5717062

Authors: Marcin Mostowski, Konrad Zdanowski 

Publication date: 11 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Recommendations

• On the F-representability of numbers
• scientific article; zbMATH DE number 3887669
• FM-criterion for representative points
• scientific article; zbMATH DE number 2154399
• Representability of functions
• A representable approach to finite nondeterminism
• On representing concepts in finite models
• Flexible representation analysis

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)

Cited In (4)

• Theories of initial segments of standard models of arithmetics and their complete extensions
• Representability of functions in finite models. Arithmetical theories
• FM-criterion for representative points
• Arithmetic of divisibility in finite models

This page was built for publication: New Computational Paradigms

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