The Modal Logic of the Countable Random Frame Export

@misc{citeulike:1597345, abstract = {We study the modal logic ML^r of the countable random frame, which is contained in and 'approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of ML^r and show that it is not nitely axiomatizable. Then we describe the finite frames of that logic and show that it has the finite frame property and its satisfiability problem is...}, author = {Goranko, Valentin and Kapron, Bruce}, citeulike-article-id = {1597345}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.4620}, keywords = {logic, modal, model\_theory}, posted-at = {2007-08-27 22:47:28}, priority = {2}, title = {The Modal Logic of the Countable Random Frame}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.4620} }

TY - GEN ID - citeulike:1597345 L3 - citeulike-article-id:1597345 N2 - We study the modal logic ML^r of the countable random frame, which is contained in and 'approximates' the modal logic of almost sure frame validity, i.e. the logic of those modal principles which are valid with asymptotic probability 1 in a randomly chosen finite frame. We give a sound and complete axiomatization of ML^r and show that it is not nitely axiomatizable. Then we describe the finite frames of that logic and show that it has the finite frame property and its satisfiability problem is... TI - The Modal Logic of the Countable Random Frame KW - logic KW - modal KW - model_theory AU - Goranko, Valentin AU - Kapron, Bruce UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.4620 ER -