Decidability problems in languages with Henkin quantifiers
type: Item
instance of: scholarly article
title: Decidability problems in languages with Henkin quantifiers
zbMATH Open document ID: 0764.03013
DOI: 10.1016/0168-0072(92)90003-I
author: Michał Krynicki
author: Marcin Mostowski
published in: Annals of Pure and Applied Logic
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 03C80
Mathematics Subject Classification ID: 03B25
zbMATH DE Number: 92990
zbMATH Keywords: Henkin quantifiers
zbMATH Keywords: theory of equality
zbMATH Keywords: word problem for semigroups
zbMATH Keywords: function quantifiers
MaRDI profile type: Publication
cites work: The theory of abelian p-groups with the quantifier I is decidable
cites work: Model theory.
cites work: Finite Partially‐Ordered Quantifiers
cites work: Q5732647
cites work: The Härtig quantifier: a survey
cites work: On the semantics of the Henkin quantifier
cites work: Henkin and function quantifiers
cites work: Q3475261
cites work: Pure Logic with Branched Quantifiers
cites work: Q3989926
cites work: Finite partially-ordered quantification
full work available at URL: 0168-0072(92)90003-i
OpenAlex ID: W2072372034
description: scientific article; zbMATH DE number 92990