A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
A Structural Benchmark for Logical Argumentation Frameworks
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
We instantiate abstract argumentation frameworks with existential rules, a language widely used in Semantic Web applications and provide a generator of such instantiated graphs. ...
of existentially closed atoms and − → X , − → Y , − → Z their respective vectors of variables. ...
However, the graphs from this benchmark are small (many of them have less than 10 arguments) and their structure is simplistic. ...
doi:10.1007/978-3-319-68765-0_28
fatcat:ze6u5kyi4fcunihpqztzm5u6ia
Reflections on existential types
[article]
2022
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Existential types are reconstructed in terms of small reflective subuniverses and dependent sums. ...
that accommodates higher-order first-class recursive modules and higher-order store. ...
Acknowledgments I'm thankful to Robert Harper for many productive and enlightening conversations on the subject of modules, existential types, and reflective subuniverses; thanks to Dan Licata and Michael ...
arXiv:2210.00758v1
fatcat:euhhaveme5gdpcjmqecbenv5ei
Using dependent types to express modular structure
1986
Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
We review and compare the basic type-theoretic ideas behind these languages and evaluate how they meet the pragmatic requirements of "programming in the large". ...
Several related typed languages for modular programming and data abstraction have been proposed recently, including Pebble, SOL, and ML modules. ...
Being elements of large types, polymorphic functions and Σ 2 -structures are also level 1 objects, i.e. they are of the same level as small types. ...
doi:10.1145/512644.512670
dblp:conf/popl/MacQueen86
fatcat:zu3vqpcmizeqzc2nw5lyqqbf4q
PAC structures in nutshell
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
By Lemma 3.3 in [16] , if A is an existentially closed substructure of B (where A and B are small substructures of C), then A ⊆ B is regular, so regular extensions are related to existential closedness ...
A substructure is existentially closed if it is existentially closed in all extensions (i.e. all small extensions living inside C). ...
arXiv:1905.09741v1
fatcat:vzardlsqfjfc5h4xq43q343o4q
Existential, Possessive and Locative Constructions in Yami Language: A comparative study to Formosan languages
2020
Macrolinguistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Abstract:This study reports on Yami existential, possessive and locative constructions, regarding the issues on (i) two 'HAVE' structures, (ii) Definiteness Effect (DE) and (iii) an analysis of small clause ...
Finally, this study also argues that the existential verb amian/abo 'exist/not exist' in Yami selects a small clause as its complement, representing a relative clause. ...
The small clause is closely related to the phenomena of raising-to-object, exceptional case-marking (ECM), accusativus cum infinitivo, and object control, which all indicate the analysis of a mono-clause ...
doi:10.26478/ja2020.8.12.4
fatcat:d4bz2c7ctnawzhd4bdljrxin2i
Existentially Closed Exponential Fields
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We extend some notions from classification theory to positive logic and position the category of existentially closed exponential fields in the stability hierarchy as NSOP_1 but TP_2. ...
We characterise the existentially closed models of the theory of exponential fields. They do not form an elementary class, but can be studied using positive logic. ...
Acknowledgement The first named author would like to thank Rémi Jaoui and Rahim Moosa for many discussions around the topics of this paper. ...
arXiv:1812.08271v2
fatcat:ukvghtr4cvb7tkpa4rakt63ase
On preservation under homomorphisms and unions of conjunctive queries
2006
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These queries are definable by existential positive first-order formulas and are preserved under homomorphisms. ...
Specifically, we show that this result holds for all classes of finite structures of bounded degree, all classes of finite structures of bounded treewidth, and, more generally, all classes of finite structures ...
Furthermore, one cannot remove a small number of elements from a large minimal model to create such a scattered set. ...
doi:10.1145/1131342.1131344
fatcat:so4vunsin5bjnnjtgeaa7m6u2y
On preservation under homomorphisms and unions of conjunctive queries
2004
Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '04
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These queries are definable by existential positive first-order formulas and are preserved under homomorphisms. ...
Specifically, we show that this result holds for all classes of finite structures of bounded degree, all classes of finite structures of bounded treewidth, and, more generally, all classes of finite structures ...
Furthermore, one cannot remove a small number of elements from a large minimal model to create such a scattered set. ...
doi:10.1145/1055558.1055602
dblp:conf/pods/AtseriasDK04
fatcat:6gb56nqbn5brleyr2qcshhc6um
Automorphisms of κ -existentially closed groups
[article]
2020
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
We investigate the automorphisms of some κ - existentially closed groups. ...
In particular, we prove that Aut(G) is the union of subgroups of level preserving automorphisms and |Aut(G)|=2^κ whenever κ is inaccessible and G is the unique κ -existentially closed group of cardinality ...
It turns out that embeddings of small groups into a κ -existentially closed group can be extended to embeddings of their small supergroups. Lemma 5. Let G be a κ -existentially closed group. ...
arXiv:2012.15167v1
fatcat:w3iexd44l5bzfbukdgplfdctde
Learning conjunctive concepts in structural domains
1989
Machine Learning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In establishing this result, we calculate the capacity of the hypothesis space of conjunctive concepts in a structural domain and use a general theorem of Vapnik and Chervonenkis. ...
We study the problem of learning conjunctive concepts from examples on structural domains like the blocks world. ...
I would also like to thank Lenny Pitt, Les Valiant, Nick Littlestone, Manfred Warmuth and an anonymous referee for helpful comments concerning this material.
Notes ...
doi:10.1007/bf00114802
fatcat:jarpyi7dlvcyrczhwxcxm4crvm
Simple generic structures
2003
Annals of Pure and Applied Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The investigations by Hrushovski (preprint, 1997) and Pillay (Forking in the category of existentially closed structures, preprint, 1999), provide a general theory for forking and simplicity for the nonelementary ...
Here TNat and the class of existentially closed models of (TNat) ∀ =T+; EX (T+), play an important role in description of the theory of the K0; ≺ -generic. ...
Wagner and the referee for their useful and constructive comments. ...
doi:10.1016/s0168-0072(02)00114-8
fatcat:cg3v4yigyja6xoquhjfghpnuam
Irish Existentials in Context
2014
Syntax
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Now note that in existentials (and in certain closely related clause-types), the subject may follow a -edge adverb; examples with the general structure in () occur freely, as shown in () In all ...
Put another way: codas are obligatory in Irish existential structures. If existential ann is predicative, finally, we can understand another contrast between the existential structures of Irish and those ...
doi:10.1111/synt.12020
fatcat:37rh2v2ikvc77ig2xluyaqg5wm
Preservation Under Extensions on Well-Behaved Finite Structures
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We show that the property holds of classes of acyclic structures, structures of bounded degree and more generally structures that are wide in a sense we make precise. ...
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent to an existential sentence ...
We show that the extension preservation theorem holds on any class of finite structures closed under substructures and disjoint unions that is also wide in the sense that any sufficiently large structure ...
doi:10.1007/11523468_116
fatcat:4oo72e6lfvaddjlgnhohv3y74m
Preservation under Extensions on Well-Behaved Finite Structures
2008
SIAM journal on computing (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
We show that the property holds of classes of acyclic structures, structures of bounded degree and more generally structures that are wide in a sense we make precise. ...
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent to an existential sentence ...
We show that the extension preservation theorem holds on any class of finite structures closed under substructures and disjoint unions that is also wide in the sense that any sufficiently large structure ...
doi:10.1137/060658709
fatcat:ztyq33hisjhyzbszc24fyaykgm
Some Applications of the Ultrapower Theorem to the Theory of Compacta
[chapter]
2000
Papers in Honour of Bernhard Banaschewski
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Quine [23] applies the word syncategorematic to such adjectives as "co-existentially closed," "free," and "small" used in this way.) ...
Suppose X is a coexistentially closed compactum. Then X is a co-existential image of a Stone-Čech compactification β (I) for a suitably large discrete space I. ...
doi:10.1007/978-94-017-2529-3_4
fatcat:ashfdd2bivhifbin2s2pqlhdda
« Previous
Showing results 1 — 15 out of 64,138 results