New Computational Paradigms

DOI10.1007/B136981MaRDI QIDQ5717062zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(5)

• Representability of functions in finite models. Arithmetical theories
• Arithmetic of divisibility in finite models
• FM-criterion for representative points
• Theories of initial segments of standard models of arithmetics and their complete extensions
• Modal quantifiers, potential infinity, and Yablo sequences

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)