Definability Over the Class of all Partitions

DOI10.1093/logcom/exl024zbMath1116.03015OpenAlexW2100106604MaRDI QIDQ3431961

Tinko Tinchev, Philippe Balbiani

Publication date: 13 April 2007

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exl024

zbMATH Keywords

complexitydecidabilityfirst-order definabilitymodal definability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items (2)

Definability in the class of all -frames – computability and complexity ⋮ Second-order logic on equivalence relations

This page was built for publication: Definability Over the Class of all Partitions