Monadicity of non-deterministic logical matrices is undecidable
From MaRDI portal
Publication:6659898
DOI10.4204/EPTCS.358.5MaRDI QIDQ6659898FDOQ6659898
Sérgio Marcelino, Pedro Filipe, Carlos Caleiro
Publication date: 9 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Theory of logical calculi. Basic theory of consequence operations
- Function Algebras on Finite Sets
- Cut-free sequent calculi for C-systems with generalized finite-valued semantics
- Non-deterministic Multiple-valued Structures
- Closure properties and decision problems of dag automata
- Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
- Disjoint fibring of non-deterministic matrices
- Logics of left variable inclusion and Płonka sums of matrices
- Analytic calculi for monadic PNmatrices
- Axiomatizing non-deterministic many-valued generalized consequence relations
- REXPANSIONS OF NONDETERMINISTIC MATRICES AND THEIR APPLICATIONS IN NONCLASSICAL LOGICS
This page was built for publication: Monadicity of non-deterministic logical matrices is undecidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6659898)
