CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Decidability results for classes of purely universal formulae and quantifiers elimination in Set Theory
Authors
Cantone D
Cutello V
Policriti A
Publication date
1 January 1988
Publisher
Abstract
A general mechanism to extend decision algorithms to deal with additional predicates is described. The only conditions imposed on the predicates is stability with respect to some transitive relations
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Directory of Open Access Journals
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:doaj.org/article:822597112...
Last time updated on 17/12/2014
Institutional Research Information System
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:air.uniud.it:11390/682603
Last time updated on 17/04/2020
Archivio istituzionale della ricerca - Università degli Studi di Udine
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:air.uniud.it:11390/682603
Last time updated on 12/11/2016