847 research outputs found

    A Friend of Tax Collectors and Sinners : An Intertextual Reading of Luke\u27s Jesus According to Divine Identity and YHWH Shepherd Language

    Get PDF
    Luke’s Gospel has been heralded as the Gospel for the outcast. This study suggests a biblical-theological approach to Luke’s depiction of Jesus that may guide an interpretation of Jesus’ person and activity. This study assumes an intertextual reading of Luke and identifies qualities and activities that he possesses and assumes according to Old Testament texts. Old Testament prophetic texts and Second Temple Jewish texts detailing YHWH’s intentions to return as Shepherd to his scattered and exiled people are examined. Luke’s birth narrative and accounts of dynamic moments in Jesus’ ministry (Lk 15:1-7; 19:1-10) are read in light of this intertextual relationship, and divine identity concepts and creedal rhythms are suggested as components of a framework that contributes to an understanding of Luke’s Jesus in light of the larger movement of Israel’s Scripture. Ultimately, it is suggested that this reading of Luke presents Jesus as possessing the identity of YHWH Shepherd

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    Natural revision is contingently-conditionalized revision

    Full text link
    Natural revision seems so natural: it changes beliefs as little as possible to incorporate new information. Yet, some counterexamples show it wrong. It is so conservative that it never fully believes. It only believes in the current conditions. This is right in some cases and wrong in others. Which is which? The answer requires extending natural revision from simple formulae expressing universal truths (something holds) to conditionals expressing conditional truth (something holds in certain conditions). The extension is based on the basic principles natural revision follows, identified as minimal change, indifference and naivety: change beliefs as little as possible; equate the likeliness of scenarios by default; believe all until contradicted. The extension says that natural revision restricts changes to the current conditions. A comparison with an unrestricting revision shows what exactly the current conditions are. It is not what currently considered true if it contradicts the new information. It includes something more and more unlikely until the new information is at least possible

    Provable better quasi orders

    Full text link
    It has recently been shown that fairly strong axiom systems such as ACA0\mathsf{ACA}_0 cannot prove that the antichain with three elements is a better quasi order (bqo\mathsf{bqo}). In the present paper, we give a complete characterization of the finite partial orders that are provably bqo\mathsf{bqo} in such axiom systems. The result will also be extended to infinite orders. As an application, we derive that a version of the minimal bad array lemma is weak over ACA0\mathsf{ACA_0}. In sharp contrast, a recent result shows that the same version is equivalent to Π21\Pi^1_2-comprehension over the stronger base theory ATR0\mathsf{ATR}_0

    Understanding the interplay of entanglement and nonlocality: motivating and developing a new branch of entanglement theory

    Get PDF
    A standard approach to quantifying resources is to determine which operations on the resources are freely available, and to deduce the partial order over resources that is induced by the relation of convertibility under the free operations. If the resource of interest is the nonclassicality of the correlations embodied in a quantum state, i.e., entanglemententanglement, then the common assumption is that the appropriate choice of free operations is Local Operations and Classical Communication (LOCC). We here advocate for the study of a different choice of free operations, namely, Local Operations and Shared Randomness (LOSR), and demonstrate its utility in understanding the interplay between the entanglement of states and the nonlocality of the correlations in Bell experiments. Specifically, we show that the LOSR paradigm (i) provides a resolution of the anomalies of nonlocality\textit{anomalies of nonlocality}, wherein partially entangled states exhibit more nonlocality than maximally entangled states, (ii) entails new notions of genuine multipartite entanglement and nonlocality that are free of the pathological features of the conventional notions, and (iii) makes possible a resource-theoretic account of the self-testing of entangled states which generalizes and simplifies prior results. Along the way, we derive some fundamental results concerning the necessary and sufficient conditions for convertibility between pure entangled states under LOSR and highlight some of their consequences, such as the impossibility of catalysis for bipartite pure states. The resource-theoretic perspective also clarifies why it is neither surprising nor problematic that there are mixed entangled states which do not violate any Bell inequality. Our results motivate the study of LOSR-entanglement as a new branch of entanglement theory

    On language classes accepted by stateless 5′ → 3′ Watson-Crick finite automata

    Get PDF
    Watson-Crick automata are belonging to the natural computing paradigm as these finite automata are working on strings representing DNA molecules. Watson-Crick automata have two reading heads, and in the 5 ′ → 3 ′ models these two heads start from the two extremes of the input. This is well motivated by the fact that DNA strands have 5 ′ and 3 ′ ends based on the fact which carbon atoms of the sugar group is used in the covalent bonds to continue the strand. However, in the two stranded DNA, the directions of the strands are opposite, so that, if an enzyme would read the strand it may read each strand in its 5 ′ to 3 ′ direction, which means physically opposite directions starting from the two extremes of the molecule. On the other hand, enzymes may not have inner states, thus those Watson-Crick automata which are stateless (i.e. have exactly one state) are more realistic from this point of view. In this paper these stateless 5 ′ → 3 ′ Watson-Crick automata are studied and some properties of the language classes accepted by their variants are proven. We show hierarchy results, and also a “pumping”, i.e., iteration result for these languages that can be used to prove that some languages may not be in the class accepted by the class of stateless 5 ′ → 3 ′ Watson-Crick automata

    Learning the String Partial Order

    Full text link
    We show that most structured prediction problems can be solved in linear time and space by considering them as partial orderings of the tokens in the input string. Our method computes real numbers for each token in an input string and sorts the tokens accordingly, resulting in as few as 2 total orders of the tokens in the string. Each total order possesses a set of edges oriented from smaller to greater tokens. The intersection of total orders results in a partial order over the set of input tokens, which is then decoded into a directed graph representing the desired structure. Experiments show that our method achieves 95.4 LAS and 96.9 UAS by using an intersection of 2 total orders, 95.7 LAS and 97.1 UAS with 4 on the English Penn Treebank dependency parsing benchmark. Our method is also the first linear-complexity coreference resolution model and achieves 79.2 F1 on the English OntoNotes benchmark, which is comparable with state of the art.Comment: 12 page

    Novel Analytical Methods in Food Analysis

    Get PDF
    This reprint provides information on the novel analytical methods used to address challenges occurring at academic, regulatory, and commercial level. All topics covered include information on the basic principles, procedures, advantages, limitations, and applications. Integration of biological reagents, (nano)materials, technologies, and physical principles (spectroscopy and spectrometry) are discussed. This reprint is ideal for professionals of the food industry, regulatory bodies, as well as researchers

    A Sharp Mizohata-Takeuchi Type Estimate for the Cone in R3\mathbb R^3

    Full text link
    We prove an analog of the Mizohata-Takeuchi conjecture for the cone in R3\mathbb R^3 and the 1-dimensional weights.Comment: 30 pages, 2 figure

    State-deterministic Finite Automata with Translucent Letters and Finite Automata with Nondeterministically Translucent Letters

    Full text link
    Deterministic and nondeterministic finite automata with translucent letters were introduced by Nagy and Otto more than a decade ago as Cooperative Distributed systems of a kind of stateless restarting automata with window size one. These finite state machines have a surprisingly large expressive power: all commutative semi-linear languages and all rational trace languages can be accepted by them including various not context-free languages. While the nondeterministic variant defines a language class with nice closure properties, the deterministic variant is weaker, however it contains all regular languages, some non-regular context-free languages, as the Dyck language, and also some languages that are not even context-free. In all those models for each state, the letters of the alphabet could be in one of the following categories: the automaton cannot see the letter (it is translucent), there is a transition defined on the letter (maybe more than one transitions in nondeterministic case) or none of the above categories (the automaton gets stuck by seeing this letter at the given state and this computation is not accepting). State-deterministic automata are recent models, where the next state of the computation determined by the structure of the automata and it is independent of the processed letters. In this paper our aim is twofold, on the one hand, we investigate state-deterministic finite automata with translucent letters. These automata are specially restricted deterministic finite automata with translucent letters. In the other novel model we present, it is allowed that for a state the set of translucent letters and the set of letters for which transition is defined are not disjoint. One can interpret this fact that the automaton has a nondeterministic choice for each occurrence of such letters to see them (and then erase and make the transition) or not to see that occurrence at that time. Based on these semi-translucent letters, the expressive power of the automata increases, i.e., in this way a proper generalization of the previous models is obtained.Comment: In Proceedings AFL 2023, arXiv:2309.0112
    • …
    corecore