Related papers: Composition Conditions for Classes of Analytic Fun…
We present a system for the investigation of computational properties of categorial grammar parsing based on a labelled analytic tableaux theorem prover. This proof method allows us to take a modular approach, in which the basic grammar can…
We provide conditions under which the union of two first-order theories has the amalgamation property.
We provide an expository account of some of the Hopf algebras that can be defined using trees, labeled trees, ordered trees and heap ordered trees. We also describe some actions of these Hopf algebras on algebra of functions.
We give a constructive description of H{\"o}lder-like classes of functions on chord-arc curves in $\mathbb{R}^3$ in terms of a rate of approximation by harmonic functions in shrinking neighborhoods of those curve.
This paper describes an alignment-based model for interpreting natural language instructions in context. We approach instruction following as a search over plans, scoring sequences of actions conditioned on structured observations of text…
Applying the subordination principle for analytic functions in the open unit disk U, I. H. Kim and N. E. Cho (Comput. Math. Appl. 59(2010), 2067-2073) considered some sufficient conditions for Carath\'eodory functions. The purpose of this…
In this paper we prove that in the context of varieties with Right Existentially Definable Factor Congruences, definability of the property "e and f are complementary central elements", stability by complements and coextensivity of its…
Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane C have uniformly perfect attractor sets. Examples are given to illustrate the main theorem, as well as to indicate…
We prove Artin's axioms satisfy a compatibility for composition of 1-morphisms of stacks in groupoids. Consequently, some natural stacks in groupoids are algebraic, including a common generalization of Vistoli's Hilbert stack and the stack…
We construct a homotopy initial functor from the partition complex of a finite set $A$ to a category of trees with leaves labelled by $A$. As an application, this provides an equivalence between different bar constructions of an operad. In…
Using an unambiguous characterization of Trace Anomalies a general proof of matching for Type A and B anomalies in the broken phases of Conformal Field Theories is given. The general constraints on amplitudes of energy-momentum tensors and…
It is known that not only classical semantics but also intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth tables, or truth functions. In our previous work, it…
In the paper we study choice functions on posets satisfying the conditions of heredity and outcast. For every well-ordered sequence of elements of poset, we define the corresponding `elementary' choice function. Every such a choice function…
We study conditions for the existence of stable and group-strategy-proof mechanisms in a many-to-one matching model with contracts if students' preferences are monotone in contract terms. We show that "equivalence", properly defined, to a…
Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…
We derive an analytic class number formula valid for an order in a product of $S$-integers in global fields, or equivalently for reduced finite-type affine schemes of pure dimension $1$ over $\mathbb{Z}$.
We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.
In this work a composition-decomposition technique is presented that correlates tree eigenvectors with certain eigenvectors of an associated so-called skeleton forest. In particular, the matching properties of a skeleton determine the…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given.…