Primal logic of information

DOI10.1145/3714426MaRDI QIDQ6975827zbMATH OpenFDO

Authors Yuri Gurevich, Andreas Blass

Publication date 4 June 2025

Published in ACM Transactions on Computational Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3714426

zbMATH Keywords

informationlinear timeinfonprimal logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Cites work

• scientific article; zbMATH DE number 49692 (Why is no real title available?)
• scientific article; zbMATH DE number 5488086 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• scientific article; zbMATH DE number 3366917 (Why is no real title available?)
• scientific article; zbMATH DE number 965572 (Why is no real title available?)
• Basic primal infon logic
• Computability of Recursive Functions
• Consequence Relations
• Intuitionistic propositional logic is polynomial-space complete
• Kolmogorov Complexity and Algorithmic Randomness
• Logic of infons, the propositional case
• Primal infon logic with conjunctions as sets
• Propositional primal logic with disjunction
• Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
• Transitive primal infon logic

This page was built for publication: Primal logic of information

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