I like your “tralsity” terminology. I think I was thinking about this differently from you. I was thinking from a computer science or graph theory perspective, where the “solution” to an argument would b the set of families of state transitions for statements when the truth values are updated iteratively.
This is more related to arguments, systems of statements, being valid or invalid, tautological, or contradictory… although I think the ideas would need to be extended in some way to apply to arguments with cyclic form, as opposed to the more normal form of having premises and conclusions.
It seems like tralsity, which you are talking about, is more focused on assigning valid tralse values to statements regardless of them having logical contradictions. I think this is an interesting thing to be trying to do. I think I prefer the argument structure and state transition approach because it would point out which states are valid and what is causing the state to be invalid when it is invalid.
So rather than “this statement is false” going to “x=-x” and being solved as 0, it would go to “x<--x” and the solution would be the sequence ”...-1,1,-1,1,-1,1...” which is unrolled from a state transition that might look something like {( x=1 --> x=-1 ), ( x=-1 --> x=1)}, or something similar. That creates a single connected transition graph with two nodes, one representing the state “x=1” and one representing the state “x=-1″ with each pointing at the other. And that is the only system of transitions this argument can take. But other arguments might have disconnected transition graphs. Only states in transition graphs that only point to themselves would be valid, but the different kinds of subgraphs with more than one node would tell you about the way they are invalid.
Haha… sorry, this isn’t fully thought through so I apologize if it isn’t clear or easy to follow.
I think there’s probably a relationship between this idea of assigning tralsity to states vs looking at transition graphs for arguments, but I’m not sure exactly what that relationship would be.
It is reminding me of the book “Topoi: the categorical analysis of logic” which I have not gotten into far enough to know if it is related at all or not.
Comment erased
I like your “tralsity” terminology. I think I was thinking about this differently from you. I was thinking from a computer science or graph theory perspective, where the “solution” to an argument would b the set of families of state transitions for statements when the truth values are updated iteratively.
This is more related to arguments, systems of statements, being valid or invalid, tautological, or contradictory… although I think the ideas would need to be extended in some way to apply to arguments with cyclic form, as opposed to the more normal form of having premises and conclusions.
It seems like tralsity, which you are talking about, is more focused on assigning valid tralse values to statements regardless of them having logical contradictions. I think this is an interesting thing to be trying to do. I think I prefer the argument structure and state transition approach because it would point out which states are valid and what is causing the state to be invalid when it is invalid.
So rather than “this statement is false” going to “x=-x” and being solved as 0, it would go to “x<--x” and the solution would be the sequence ”...-1,1,-1,1,-1,1...” which is unrolled from a state transition that might look something like {( x=1 --> x=-1 ), ( x=-1 --> x=1)}, or something similar. That creates a single connected transition graph with two nodes, one representing the state “x=1” and one representing the state “x=-1″ with each pointing at the other. And that is the only system of transitions this argument can take. But other arguments might have disconnected transition graphs. Only states in transition graphs that only point to themselves would be valid, but the different kinds of subgraphs with more than one node would tell you about the way they are invalid.
Haha… sorry, this isn’t fully thought through so I apologize if it isn’t clear or easy to follow.
I think there’s probably a relationship between this idea of assigning tralsity to states vs looking at transition graphs for arguments, but I’m not sure exactly what that relationship would be.
It is reminding me of the book “Topoi: the categorical analysis of logic” which I have not gotten into far enough to know if it is related at all or not.
Alas, so much math, so little time.