2000 character limit reached
A geometrical view of I/O logic
Published 28 Nov 2019 in cs.LO | (1911.12837v1)
Abstract: We describe a geometrical account of the I/O logic put forth by Makinson and van der Torre. A soundness and completeness results was reported for the simplest I/O operation called simple-minded, and in the finite case only. On this account a generator acts as a "jump" within a lattice.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.