Extended Partial Geometries: Nets and Dual Nets
نویسندگان
چکیده
منابع مشابه
Subplane covered nets and semipartial geometries
De Clerck, F. and N.L. Johnson, Subplane covered nets and semipartial geometries, Discrete Mathematics 106/107 (1992) 127-134. Using the characterization theorems for (semi)partiaI geometries which satisfy the diagonal axiom, we prove that subplane covered nets or equivalently (n I)-regulus nets are isomorphic to the dual of the geometry %?:+I with point set, the set of points of a projective s...
متن کاملNETS AND SEPARATED S-POSETS
Nets, useful topological tools, used to generalize certainconcepts that may only be general enough in the context of metricspaces. In this work we introduce this concept in an $S$-poset, aposet with an action of a posemigroup $S$ on it whichis a very useful structure in computer sciences and interestingfor mathematicians, and give the the concept of $S$-net. Using $S$-nets and itsconvergency we...
متن کاملExtended Synchronized Choice Nets
Unlike traditional classification by output conditions of places, synchronized choice nets (SNCs) were defined as a new class of nets where all first-order structures (FOSs) are symmetric. SNCs are extended to deal with nets with asymmetric first-order structures (AFOSs). A subclass called extended SNCs (ESNCs) can be converted to a general Petri net, called a weighted SNC (WSNC). A WSNC is an ...
متن کاملIntuitionistic Dual-intuitionistic Nets
The intuitionistic sequent calculus (at most one formula on the right-hand side of sequents) comes with a natural dual system: the dual-intuitionistic sequent calculus (at most one formula on the left-hand side). We explain how the duality between these two systems exactly corresponds to the intensively studied duality between call-by-value systems and call-by-name systems for classical logic. ...
متن کاملPolarized Proof - Nets : Proof - Nets for LC ( Extended
We deene a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard's classical sequent calculus LC 4]. This allows us to deene a translation between the two systems. Then we study the application of this polarization constraint to proof-nets for full linear logic described in 7]. This yields an important simpli-cation of the correctness criterion for polarized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 1990
ISSN: 0195-6698
DOI: 10.1016/s0195-6698(13)80138-2