A complete first-order logic with infinitary predicates

DOI10.4064/FM-52-2-177-203zbMath0115.00604OpenAlexW325312350MaRDI QIDQ5723182

H. Jerome Keisler

Publication date: 1963

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213701

zbMATH Keywords

mathematical logic

Related Items (13)

Structured algebraic specifications: A kernel language ⋮ Representations of polyadic-like equality algebras ⋮ On notions of representability for cylindric‐polyadic algebras, and a solution to the finitizability problem for quantifier logics with equality ⋮ Varying interpolation and amalgamation in polyadic MV-algebras ⋮ Amalgamation of Polyadic Algebras ⋮ The class of completely representable polyadic algebras of infinite dimensions is elementary ⋮ Algebraization of quantifier logics, an introductory overview ⋮ Neat embeddings as adjoint situations ⋮ Cylindric algebras and finite polyadic algebras ⋮ On universal algebraic constructions of logics ⋮ On natural number objects, finiteness and Kripke-Platek models in toposes ⋮ The class of polyadic algebras has the super amalgamation property ⋮ On conservative extensions in logics with infinitary predicates

This page was built for publication: A complete first-order logic with infinitary predicates