Elimination of loop-check for logic of idealized knowledge
Aida Pliuškevičienė
Lietuvos Matematikos Rinkinys · 2009
doi:10.15388/lmr.2009.46 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In the paper loop-check-free sequent calculus for logic of idealized knowledge is presented. To obtain termination of derivation indices and marks are used instead of history.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.