19 citations · 42 across the 6 of their papers we have counts for
8 papers
Characterizations of classes of countable Boolean inverse monoids
Mark V. Lawson, Philip Scott
A countably infinite Boolean inverse monoid that can be written as an increasing union of finite Boolean inverse monoids (suitably embedded) is said to be of finite type. Borrowing…
Polymorphic Automorphisms and the Picard Group
Pieter Hofstra, Jason Parker, Philip J. Scott
We investigate the concept of definable, or inner, automorphism in the logical setting of partial Horn theories. The central technical result extends a syntactical characterization…
Aspects of categorical recursion theory
Pieter Hofstra, Philip Scott
We present a survey of some developments in the general area of category-theoretic approaches to the theory of computation, with a focus on topics and ideas particularly close to t…
Finiteness spaces and generalized power series
Richard Blute, Robin Cockett, Pierre-Alain Jacqmin +1
We consider Ribenboim's construction of rings of generalized power series. Ribenboim's construction makes use of a special class of partially ordered monoids and a special class of…
On Geometry of Interaction for Polarized Linear Logic
Masahiro Hamano, Philip Scott
We present Geometry of Interaction (GoI) models for Multiplicative Polarized Linear Logic, MLLP, which is the multiplicative fragment of Olivier Laurent's Polarized Linear Logic. T…
AF inverse monoids and the structure of countable MV-algebras
Mark V. Lawson, Philip Scott
We define a class of inverse monoids having the property that their lattices of principal ideals naturally form an MV-algebra. We say that an arbitrary MV-algebra can be co-ordinat…