Set Theory and Nominalization, Part I
From MaRDI portal
Publication:5285989
DOI10.1093/LOGCOM/2.5.579zbMATH Open0781.03002OpenAlexW2111925554MaRDI QIDQ5285989FDOQ5285989
Authors: Fairouz Kamareddine
Publication date: 29 June 1993
Published in: Journal Of Logic And Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/logcom/2.5.579
Recommendations
Philosophical and critical aspects of logic and foundations (03A05) Semantics in the theory of computing (68Q55) Set theory (03E99)
Cited In (9)
- Set Theory and Nominalization, Part II
- A unified approach to type theory through a refined \(\lambda\)-calculus
- An algebraic generalization of Frege structures -- binding algebras
- Nominal Domain Theory for Concurrency
- Title not available (Why is that?)
- Basics of intensionalized data: presets, sets, and nominats
- A type free theory and collective/distributive predication
- Nominalization and Scott's domains. II
- Three theories of nominalized predicates
This page was built for publication: Set Theory and Nominalization, Part I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5285989)