Tabular intermediate logics comparison

DOI10.1007/978-3-031-99536-1_20MaRDI QIDQ6876447zbMATH OpenFDO

Authors Paweł Rzążewski, Michał M. Stronkowski

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-99536-1_20

zbMATH Keywords

\(p\)-morphismlogics comparisontabular intermediate logic

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A complete complexity classification of the role assignment problem
• A short introduction to intuitionistic logic
• An algorithmic framework for locally constrained homomorphisms
• Comparing universal covers in polynomial time
• Graph theory
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 7015117 (Why is no real title available?)
• scientific article; zbMATH DE number 3356739 (Why is no real title available?)
• Introduction to algorithms.
• Jankov's theorems for intermediate logics in the setting of universal models
• Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
• On the complexity of planar covering of small graphs
• Ordered sets
• Planar graphs and poset dimension
• Regular codes in regular graphs are difficult
• Role colouring a graph
• The role assignment model nearly fits most social networks

This page was built for publication: Tabular intermediate logics comparison

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