Uniform short proofs for classical theorems

DOI10.1305/NDJFL/1054837939zbMATH Open1031.03057OpenAlexW2019520691MaRDI QIDQ1409313FDOQ1409313

Authors: Kees Doets 

Publication date: 13 October 2003

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1054837939

zbMATH Keywords

interpolationpreservation[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Lindstr%EF%BF%BD%EF%BF%BDm+theorem&go=Go Lindstr��m theorem]back-and-forth methodmodel pair

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Basic properties of first-order languages and structures (03C07) Abstract model theory (03C95) Model theory of denumerable and separable structures (03C15) Interpolation, preservation, definability (03C40)

Cites Work

• Modal languages and bounded fragments of predicate logic
• Interpolation, preservation, and pebble games
• Title not available (Why is that?)

Cited In (1)

• Minimal from classical proofs

This page was built for publication: Uniform short proofs for classical theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1409313)