| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465710203316 |
|
|
Titolo |
Automata, Languages and Programming [[electronic resource] ] : 13th International Colloquium, Rennes, France, July 15-19, 1986. Proceedings / / edited by Laurent Kott |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1986.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XII, 476 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 226 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer logic |
Mathematical logic |
Computers |
Logics and Meanings of Programs |
Mathematical Logic and Formal Languages |
Computation by Abstract Devices |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
Characterizations of PUNC and precomputation -- Comparison of algorithms controlling concurrent access to a database: A combinatorial approach -- A new duality result concerning Voronoi diagrams -- Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial -- On exponential lowness -- A tradeoff between search and update time for the implicit dictionary problem -- Intersections of some families of languages -- Correspondence between ternary simulation and binary race analysis in gate networks -- Counting with rational functions -- Finite biprefix sets of paths in a Graph -- Parallel RAMs with owned global memory and deterministic context-free language recognition -- A Strong restriction of the inductive completion procedure -- On discerning words by automata -- Complexity classes without machines: On complete languages for UP -- Containment, separation, complete sets, and immunity of complexity classes -- On nontermination of Knuth-Bendix algorithm -- Tradeoffs for language recognition on |
|
|
|
|
|
|
|
|
|
|
parallel computing models -- Rational equivalence relations -- Some further results on digital search trees -- Knowledge, belief and time -- A termination detector for static and dynamic distributed systems with asynchronous non-first-in-first-out communication -- Decompositions of nondeterministic reductions -- Hierarchical planarity testing algorithms -- Synthesis and equivalence of concurrent systems -- The set union problem with backtracking -- Torsion matrix semigroups and recognizable transductions -- On recognizable subsets of free partially commutative monoids -- Min Cut is NP-complete for edge weighted trees -- Alternating automata, the weak monadic theory of the tree, and its complexity -- Subpolynomial complexity classes of real functions and real numbers -- Etude syntaxique des parties reconnaissables de mots infinis -- Refusal testing -- A timed model for communicating sequential processes -- A uniform reduction theorem extending a result of J. Grollmann and A. Selman -- On the complexity of deciding fair termination of probabilistic concurrent finite-state programs -- A new approach to detection of locally indicative stability -- A more efficient algorithm for lattice basis reduction -- Lower bounds by recursion theoretic arguments -- An improved algorithm for transitive closure on acyclic digraphs -- Un algorithme determinant les melanges de deux mots -- A very fast, practical algorithm for finding a negative cycle in a digraph -- A compositional reformulation of Owicki-Gries's partial correctness logic for a concurrent while language -- Semigroups and languages of dot-depth 2 -- A parallel vertex insertion algorithm for minimum spanning trees -- More complicated questions about maxima and minima, and some closures of NP -- Lower bounds for dynamic range query problems that permit subtraction (extended abstract) -- E-unification algorithms for a class of confluent term rewriting systems -- On fixed-point clones. |
|
|
|
|
|
|
|
|
|
|
|
|
|
2. |
Record Nr. |
UNINA9910790960003321 |
|
|
Autore |
Windsor Lionel J. <1974-> |
|
|
Titolo |
Paul and the vocation of Israel : how Paul's Jewish identity informs his apostolic ministry, with special reference to Romans / / Lionel J. Windsor |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Germany : , : De Gruyter, , 2014 |
|
©2014 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (320 p.) |
|
|
|
|
|
|
Collana |
|
Beihefte zur Zeitschrift für die neutestamentliche Wissenschaft, , 0171-6441 ; ; Volume 205 |
|
|
|
|
|
|
|
|
Classificazione |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Identification (Religion) - Biblical teaching |
Jews in the New Testament |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and indexes. |
|
|
|
|
|
|
Nota di contenuto |
|
Frontmatter -- Acknowledgements -- Contents -- 1. Introduction -- 2. Review of literature -- 3. Paul's language of Jewish identity -- 4. The Jewishness of Paul's vocation (Romans 1:1-15 & 15:14-33) -- 5. Paul's contest over Jewish identity (Romans 2:17-29) -- 6. Paul's fulfilment of Israel's vocation (Romans 9-11) -- 7. Conclusions -- Bibliography -- Index of Ancient Texts -- Index of Modern Authors |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
The Apostle Paul was the greatest early missionary of the Christian gospel. He was also, by his own admission, an Israelite. How can both these realities coexist in one individual? This book argues that Paul viewed his mission to the Gentiles, in and of itself, as the primary expression of his Jewish identity. The concept of Israel's divine vocation is used to shed fresh light on a number of much-debated passages in Paul's letter to the Romans. |
|
|
|
|
|
|
|
| |