975 resultados para first-order paraconsistent logic
Resumo:
The novel poly(aryl ether ketone)s were synthesized by nucleophilic substitution reactions of 4,4'-difluorobenzophenone with 4,4'-biphenyldiol and chlorohydroquinone. As expected, the copolymers have lower melting transitions than the biphenyldiol-based homopoly(aryl ether ketone) because of the copolymerization effect of the crystal-disrupting monomer chlorohydroquinone. Copolymers containing 50 and 70% biphenyldiol show two first-order transitions which are associated with the crystal-to-liquid crystal transition and the liquid crystal-to-isotropic transition.
Resumo:
A new type of macro-micro-macro triple electrode has been fabricated, the steady-state currents of solution redox species have been observed at an ultramicroband electrode by linear potential scan voltammetry, and generation/collection experiments have al
Resumo:
Most knowledge representation languages are based on classes and taxonomic relationships between classes. Taxonomic hierarchies without defaults or exceptions are semantically equivalent to a collection of formulas in first order predicate calculus. Although designers of knowledge representation languages often express an intuitive feeling that there must be some advantage to representing facts as taxonomic relationships rather than first order formulas, there are few, if any, technical results supporting this intuition. We attempt to remedy this situation by presenting a taxonomic syntax for first order predicate calculus and a series of theorems that support the claim that taxonomic syntax is superior to classical syntax.
Resumo:
We give an explicit and easy-to-verify characterization for subsets in finite total orders (infinitely many of them in general) to be uniformly definable by a first-order formula. From this characterization we derive immediately that Beth's definability theorem does not hold in any class of finite total orders, as well as that McColm's first conjecture is true for all classes of finite total orders. Another consequence is a natural 0-1 law for definable subsets on finite total orders expressed as a statement about the possible densities of first-order definable subsets.
Resumo:
A method to solve the stationary state probability is presented for the first-order bang-bang phase-locked loop (BBPLL) with nonzero loop delay. This is based on a delayed Markov chain model and a state How diagram for tracing the state history due to the loop delay. As a result, an eigenequation is obtained, and its closed form solutions are derived for some cases. After obtaining the state probability, statistical characteristics such as mean gain of the binary phase detector and timing error variance are calculated and demonstrated.
Resumo:
Spatially resolved polarization switching In ferroelectric nanocapacitors was studied on the sub-25 nm scale using the first-order reversal curve (FORC) method. The chosen capacitor geometry allows both high-veracity observation of the domain structure and mapping of polarization switching in a uniform field, synergistically combining microstructural observations and probing of uniform-field polarization responses as relevant to device operation. A classical Kolmogorov-Avrami-Ishibashi model has been adapted to the voltage domain, and the individual switching dynamics of the FORC response curves are well approximated by the adapted model. The comparison with microstructures suggests a strong spatial variability of the switching dynamics inside the nanocapacitors.
Resumo:
The Irish Competition (Amendment) Act 2012 introduced court-endorsed commitment agreements to Irish competition law. The new section 14B of the principal Competition Act 2002 provides for making commitment agreements between the Irish Competition and undertakings an order of the Irish High Court. This piece, first, investigates the prior Irish practice regarding commitment or settlement agreements and its legal basis. It looks then into the newly introduced rules on court-endorsed commitment agreements. Finally, before concluding, it points to the first instance of their application — to an order issued by the High Court in the FitFlop case in December 2012, which came into effect in February 2013.
Resumo:
In this paper we investigate the first order characteristics of the radio channel between a moving vehicle and a stationary person positioned by the side of a road at 5.8 GHz. The experiments considered a transmitter positioned at different locations on both the body and receivers positioned on the vehicle. The transmitter was alternated between positions on the central chest region, back and the wrist (facing the roadside) of the body, with the receivers placed on the outside roof, the outside rear window and the inside dashboard of the vehicle. The Rice fading model was applied to the measurement data to assess its suitability for characterizing this emerging type of wireless channel. The Ricean K factors calculated from the data suggest that a significant dominant component existed in the majority of the channels considered in this study.
Resumo:
We provide insight into the quantum correlations structure present in strongly correlated systems beyond the standard framework of bipartite entanglement. To this aim we first exploit rotationally invariant states as a test bed to detect genuine tripartite entanglement beyond the nearest neighbor in spin-1/2 models. Then we construct in a closed analytical form a family of entanglement witnesses which provides a sufficient condition to determine if a state of a many-body system formed by an arbitrary number of spin-1/2 particles possesses genuine tripartite entanglement, independently of the details of the model. We illustrate our method by analyzing in detail the anisotropic XXZ spin chain close to its phase transitions, where we demonstrate the presence of long-range multipartite entanglement near the critical point and the breaking of the symmetries associated with the quantum phase transition.
Resumo:
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks.