Reasoning with first order nondeterministic specifications

DOI10.1007/s002360050165zbMath0939.68075OpenAlexW1986234279MaRDI QIDQ1806174

Marcin Białasik, Beata Konikowska

Publication date: 1 November 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360050165

zbMATH Keywords

multi-sorted algebras

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (4)

Quantifier-free logic for nondeterministic theories ⋮ Quantifier-free logic for multialgebraic theories ⋮ A functorial semantics for multi-algebras and partial algebras, with applications to syntax. ⋮ Rasiowa-Sikorski deduction systems in computer science applications.

This page was built for publication: Reasoning with first order nondeterministic specifications