Category Archives: partial functions

A subset interpretation (with context morphisms) of the sequent calculus for predicate logic

The previous two posts used the sequent calculus with a subset interpretation: We work with sequents , and interpret the propositions (and ) as subsets of some universe set . We interpret the sequent itself as . While writing the … Continue reading

Posted in logic, partial functions | Tagged , | Leave a comment

Logic without truth

Pi is wrong! But so what? It is neither new, nor complicated enough to count as real math! And suggestions that  or  might be even better show that it not clear-cut either. I recently invested sufficient energy into some logical questions to … Continue reading

Posted in logic, partial functions | Tagged , | 6 Comments

A canonical labeling technique by Brendan McKay and isomorphism testing of deterministic finite automata

A deterministic finite automaton (DFA) is a 5-tuple, , consisting of a finite set of states a finite set of input symbols a (partial) transition function an initial state a set of accept states An isomorphism between two DFAs and … Continue reading

Posted in automata, inverse semigroups, isomorphism, partial functions | 4 Comments

Reversibility of binary relations, substochastic matrices, and partial functions

After the last post, I decided that the next post should contain images. Next I decided that the time to publish another post has come. Here is an image of an acceptor finite-state machine, parsing the string “nice”. How can … Continue reading

Posted in automata, partial functions | Tagged , | 1 Comment