Timeline for Is a computer program for correspondence theory available?
Current License: CC BY-SA 3.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Jun 13, 2018 at 8:43 | history | edited | Martin Sleziak |
added tags that the question is looking for computer program (the question has been bumped anyway by an answer - which was deleted in the meantime)
|
|
S Aug 30, 2014 at 22:19 | history | suggested | Evgeny Zolin |
Added a modal logic tag
|
|
Aug 30, 2014 at 21:48 | review | Suggested edits | |||
S Aug 30, 2014 at 22:19 | |||||
Mar 25, 2014 at 0:37 | vote | accept | Frode Alfson Bjørdal | ||
Mar 20, 2014 at 16:25 | answer | added | Frode Alfson Bjørdal | timeline score: 2 | |
Mar 20, 2014 at 10:45 | comment | added | Frode Alfson Bjørdal | Thanks Jason. Yes, indeed. It was the SCAN-algorithm which is also linked to in your link that I was using, but perhaps some of the other links provided at your site are better. | |
Mar 20, 2014 at 4:49 | comment | added | Jason Rute | A Google search got me this. cs.man.ac.uk/~schmidt/tools. Is this the sort of thing you are looking for? | |
Mar 19, 2014 at 22:50 | comment | added | Frode Alfson Bjørdal | It is the theory which studies the connections between formulas of modal logic and corresponding conditons upon the accessibility relation on "possible worlds" in the model or frame. The term "correspondence theory" is quite established. All modal logical formulas have second order correspondences, but in many interesting cases the condition can be shown to collapse to a first order condition. For instance, the formula $\square \alpha \rightarrow \square \square \alpha$ corresponds with the condition that the accessibility relation R is transitive. | |
Mar 19, 2014 at 22:32 | comment | added | Monroe Eskew | What do you mean by correspondence theory? | |
Mar 19, 2014 at 22:27 | history | asked | Frode Alfson Bjørdal | CC BY-SA 3.0 |