Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle?
From MaRDI portal
Publication:5495927
DOI10.1007/978-3-319-08434-3_18zbMath1304.68152arXiv1406.0774OpenAlexW36058415MaRDI QIDQ5495927
Manfred Kerber, Christoph Lange, Colin Rowat, Marco Bright Caminati
Publication date: 7 August 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1406.0774
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Set theory for verification. I: From foundations to functions
- Isabelle/HOL. A proof assistant for higher-order logic
- A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory
- The ForMaRE Project – Formal Mathematical Reasoning in Economics
- Code Generation via Higher-Order Rewrite Systems
- Defining functions on equivalence classes
- Theorem Proving in Higher Order Logics
- Unnamed Item
This page was built for publication: Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle?