Effectiveness in RPL, with applications to continuous logic

DOI10.1016/j.apal.2009.06.008zbMath1225.03056arXiv1006.2197OpenAlexW1998220929MaRDI QIDQ636319

Kaveh Ghasemloo, Farzad Didehvar, Massoud Pourmahdian

Publication date: 26 August 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1006.2197

zbMATH Keywords

fuzzy logiclinear theorycomputable analysiscontinuous logicdecidable modeleffective model theoryrational Pavelka logic

Mathematics Subject Classification ID

Many-valued logic (03B50) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (2)

Continuous theory of operator expansions of finite dimensional Hilbert spaces and decidability ⋮ Generalized effective completeness for continuous logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-theoretic independence in the Banach lattices \(L_{p}(\mu)\)
• Domain representability of metric spaces
• Model theoretic forcing in analysis
• A computational model for metric spaces
• Constructivism in mathematics. An introduction. Volume I
• A domain-theoretic approach to computability on the real line
• Computable Banach spaces via domain theory
• On the computability of fractal dimensions and Hausdorff measure
• Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
• Recursive and nonextendible functions over the reals; filter foundation for recursive analysis. II
• Handbook of computability theory
• Metamathematics of fuzzy logic
• Domain representations of topological spaces
• Effective completeness theorems for modal logic
• Proof theory for fuzzy logics
• Continuous first order logic and local stability
• Computable functionals
• On the definitions of computable real continuous functions
• COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
• Domains for Computation in Mathematics, Physics and Exact Real Arithmetic
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• A proof of completeness for continuous first-order logic
• Computability in Analysis and Physics
• Continuous Model Theory. (AM-58)

This page was built for publication: Effectiveness in RPL, with applications to continuous logic