Decidability and complexity of fibred logics without shared connectives

DOI10.1093/jigpal/jzw033zbMath1405.03032OpenAlexW2468126247MaRDI QIDQ4644566

Sérgio Marcelino, Carlos Caleiro

Publication date: 8 January 2019

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a61b6d2e2befb5c20bd1d57def374da93fe3907e

zbMATH Keywords

complexityfibred logicsdecidability preservationdisjoint fibring

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Combined logics (03B62)

Related Items (4)

Proof search on bilateralist judgments over non-deterministic semantics ⋮ Plug and Play Negations ⋮ Characterizing finite-valuedness ⋮ On Axioms and Rexpansions

This page was built for publication: Decidability and complexity of fibred logics without shared connectives