Finite embeddability property for residuated lattices via regular languages

DOI10.1007/978-3-030-76920-8_7OpenAlexW4200448983MaRDI QIDQ6201545

Rostislav Horčík

Publication date: 25 March 2024

Published in: Outstanding Contributions to Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-76920-8_7

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) General logic (03Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic proof theory for substructural logics: cut-elimination and completions
• On regularity of context-free languages
• Residuated lattices. An algebraic glimpse at substructural logics
• Decision problems for propositional linear logic
• The finite embeddability property for residuated lattices, pocrims and BCK-algebras.
• Word problem for knotted residuated lattices.
• On square-increasing ordered monoids and idempotent semirings
• The algebra of topology
• On closed elements in closure algebras
• Two concepts from the theory of models
• The finite model property for knotted extensions of propositional linear logic
• Residuated frames with applications to decidability
• The finite embeddability property for noncommutative knotted extensions of RL
• On the finite embeddability property for residuated ordered groupoids
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• Ordering by Divisibility in Abstract Algebras
• Some Interconnections Between Modern Algebra and Mathematical Logic
• Protoalgebraic logics

This page was built for publication: Finite embeddability property for residuated lattices via regular languages