Skip to main content
5 events
when toggle format what by license comment
Oct 23, 2010 at 1:49 comment added PamNDRome @Nickolay-Kolev, thanks for the clarifications. What sort of mapping are you using from textual words to symbology? (I guess I'm asking what dictionary you're using as the canonical mechanism for defining a string of letters unambiguously.) The same string of letters is the same word but can have very different meanings in different contexts, for example.
Oct 22, 2010 at 16:41 comment added Nickolay Kolev A clarification on the requirement of "entry level": I would like to work with entry level proofs so as to concentrate on the linguistic means used in proofs while still being able to understand the proofs. I am mostly interested in the expressions used to denote premise->conclusion substructures.
Oct 22, 2010 at 16:37 comment added Nickolay Kolev I will be looking for a way to represent the proofs as a symbolic structures which would enable further processing. Formulae and symbols will be treated along with the "natural language bits". Ideally an identical proof step expressed as a formula and expressed in words should yield the same output structure. The long term goal is the interpretation of arbitrary proofs in expressions of Artemov's Justification Logic (see e.g. logic.uconn.edu/readings/Milnikel1.pdf). Checking the correctness of a proof is not a goal.
Oct 22, 2010 at 3:41 comment added Pete L. Clark I admit to having some similar questions myself. For instance, if you're doing a linguistic analysis, why does it matter whether the proofs are "entry level" or not? Or are you thinking that proofs written for a less mathematically sophisticated audience will also be less sophisticated in a purely linguistic way? (It's not clear to me whether that's a reasonable assumption or not.)
Oct 22, 2010 at 3:26 history answered PamNDRome CC BY-SA 2.5