Modal Logic as a Programming Language
ISEF · 2015
Overview
The logician Patrick Blackburn proposed several times to consider modal formulas as automata that are placed at some point inside a relational model and explore their environment by making transitions to accessible points on their own. This project realizes this idea and considers modal formulas as computer programs. Therefore, an interpreter and an incrementally extensible compiler conforming to the standard translation of the correspondence theory are implemented. Translating modal programs into executable computer programs that are able to evaluate their validity independently in every environment, this compiler turns out to be a very fast and extremely flexibly applicable model checker.
Awards (1)
- Oracle Academy: Award of $5,000 for outstanding project in the systems software category. $5,000
Competition history
- ISEF 2015
Resources
Related projects
ISEF · 2016
FLscript--An Experimentation of Logic and Functional Programming Language for the Web: Design and Implementation
ISEF · 2018
On the Validity of Composite Logical Functions
ISEF · 2014
A New Method of Discovering Mathematical Proofs
ISEF · 2015
SCC: Reversible Multi-Translation of High-Level Programming Languages and a Platform for Performance-Controlled Execution in Multi-Agent Systems
Closest projects by meaning, across every fair and year in the corpus.
Source: Regeneron International Science and Engineering Fair