Given a natural language, we can ask what the logical and computational prerequisites for generating and checking and analyzing valid expressions of that language ? And can we define the minimal, optimal way in which expressions are generated and checked and analyzed ? We are looking here at meta-grammar, the formal language of grammar itself. How rich are formal languages in themselves compared to standard algebraic systems ! How much remains to be said about the relationship between (specially imperative) programing languages and logic, between logic and recursion theory, between recursion theory and combinatorics and formal languages. These are all topics of our Analyticity and the A Priori.
No comments:
Post a Comment