Metric propositional neighborhood logic with an equivalence relation
type: Item
instance of: scholarly article
title: Metric propositional neighborhood logic with an equivalence relation
zbMATH Open document ID: 1350.68185
author: Angelo Montanari
author: Marco Pazzaglia
author: Pietro Sala
published in: Acta Informatica
publication date: 2016-10-21T00:00:00Z
full work available at URL: http://hdl.handle.net/11390/1110493
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B25
Mathematics Subject Classification ID: 03B44
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6642215
MaRDI profile type: Publication
OpenAlex ID: W2038872532
cites work: Weak MSO with the unbounding quantifier
cites work: Two-variable logic on data words
cites work: Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
cites work: Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
cites work: An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
cites work: An optimal decision procedure for right propositional neighborhood logic
cites work: Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
cites work: LTL with the freeze quantifier and register automata
cites work: Automated Reasoning with Analytic Tableaux and Related Methods
cites work: On the Decision Problem for Two-Variable First-Order Logic
cites work: On the reachability problem for 5-dimensional vector addition systems
cites work: Parallel program schemata
cites work: Two-Variable First-Order Logic with Equivalence Closure
cites work: Small substructures and decidability issues for first-order logic with two variables
cites work: Q3113783
cites work: Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness
cites work: On languages with two variables
cites work: Two variable first-order logic over ordered domains
cites work: On the decidability and complexity of Metric Temporal Logic over finite words
cites work: A Modal Logic for Chopping Intervals
DOI: 10.1007/S00236-016-0256-3
description: scientific article; zbMATH DE number 6642215