We give effective upper bounds for the number of purely inseparable points on non isotrivial curves over function fields positive characteristic and transcendence degree one. These depend genus curve, field bad reduction curve.

Assuming the continuum hypothesis there is an inseparable sequence of length ω1 that contains no Lusin subsequence, while if Martin’s Axiom and ¬CH is assumed then every inseparable sequence (of length ω1) is a union of countably many Lusin subsequences.

Recently, three approaches to deductive planning were developed, which solve the technical frame problem without the need to state frame axioms explicitly. These approaches are based on the linear connection method, an equational Horn logic, and linear logic. At rst glance these approaches seem to be very diierent. In the linear connection method a syntactical condition | each literal is connec...

In this paper we present a sound and complete lln. ear planning algorithm which accomodates conditional actions: actions whose effects cannot be predkted with certainty. Coaditioaal liaear planain8 is si~ificantly simpler than conditional non-linear plannin8 in conception and implementation. Furthermore, the eflldency tradeol which favor non-linear planning do not n~__~__rily carry over with th...

Linear Logic is a powerful formalism used to manage a lot of problems with resources. Linear Logic can also be used to formalize Petri Nets and to solve simple planning problems (for example ‘Block World‘). Research goes ahead also in Linear Logic Programming, which means that we have tools, that can solve Linear Logic problems. In this paper I will show the possible connection between solving ...