Some closure properties of finite definitions

DOI10.1023/A:1011998021743MaRDI QIDQ5951911zbMATH OpenFDO

Authors Maricarmen Martinez

Publication date 4 November 2002

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1011998021743

zbMATH Keywords

circular definitionsfinite definitionsrevision rulesrevision theory

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Other nonclassical logic (03B60)

Review text

Systems where circular definitions are allowed and the defined predicates are associated with revision rules (instead of extensions) have been studied by Gupta and Belnap. The set of finite definitions is not recursive (Gupta), so there arises the problem to characterize this set in terms of closure conditions. The main result is: Any definition that only uses symbols of unary predication and equality is bound to be finite.

Recommendations

• Definability properties and the congruence closure
• Bounds for D-finite closure properties
• Closure under transfinite extensions
• scientific article; zbMATH DE number 512854
• Gap-definability as a closure property
• A theory of finite closure spaces based on implications
• On Forward Closure and the Finite Variant Property
• scientific article; zbMATH DE number 221111
• Closure properties of \(\varinjlim \mathcal{C}\)
• Closure properties associated to natural equivalences

Cited in

(5)

• Conditionals in theories of truth
• Revision without revision sequences: circular definitions
• On Forward Closure and the Finite Variant Property
• Solovay-type theorems for circular definitions
• Guest editors' introduction

This page was built for publication: Some closure properties of finite definitions

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