About finite predicate logic

DOI10.1007/BF00370273MaRDI QIDQ1088979zbMATH OpenOpenAlexFDO

Authors Herman Dishkant

Publication date 1986

Published in Studia Logica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00370273

zbMATH Keywords

algebraic propertiesdata basesfinite mathematicsfinite predicatesmodal logic

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Modal logic (including the logic of norms) (03B45) Combinatorial aspects of finite geometries (05B25) Data structures (68P05)

Review text

We say that an n-argument predicate \(P\subset \Omega^ n\) is finite, if P is a finite set. Note that the set of individuals \(\Omega\) is infinite! Finite predicates are useful in data bases and in finite mathematics. The logic DBL proposed here operates on finite predicates only. We construct an imbedding for DBL in a special modal logic MPL. We prove that if a finite predicate is expressible in the classical logic, it is also expressible in DBL. Quantifiers are not necessary in DBL. Some simple algebraic properties of DBL are indicated.

Recommendations

• Role of determinism in query languages for data bases
• On the predicate logics of finite Kripke frames
• scientific article; zbMATH DE number 1416393
• Counting variables in a dynamic setting
• scientific article; zbMATH DE number 4101143

Cites work

• An algebraic approach to non-classical logics

Cited in

(3)

• On bijunctive predicates over a finite set
• Finite sum-product logic
• scientific article; zbMATH DE number 7297896 (Why is no real title available?)

This page was built for publication: About finite predicate logic

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