We give an algorithmic solution in a simple combinatorial data of Birkhoff s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over...
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
We define the notions of Azumaya category and Brauer group in category theory enriched over some very general base category V. We prove the equivalence of various definitions, in ...
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...