"A semantic proof of strong cut-admissibility for first-order Gödel logic."

Ori Lahav, Arnon Avron (2013)

Details and statistics

DOI: 10.1093/LOGCOM/EXS006

access: closed

type: Journal Article

metadata version: 2024-10-06

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy