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
research
Encoding TLA+ set theory into many-sorted first-order logic
Authors
Stephan Merz
Hernán Vanzetto
Publication date
16 August 2015
Publisher
View
on
arXiv
Abstract
We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art SMT solvers. This translation is the main component of a back-end prover based on SMT solvers in the TLA+ Proof System
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
INRIA a CCSD electronic archive server
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:HAL:hal-01244627v1
Last time updated on 09/11/2016