956 resultados para First order theories
Resumo:
If you want to know whether a property is true or not in a specific algebraic structure,you need to test that property on the given structure. This can be done by hand, which can be cumbersome and erroneous. In addition, the time consumed in testing depends on the size of the structure where the property is applied. We present an implementation of a system for finding counterexamples and testing properties of models of first-order theories. This system is supposed to provide a convenient and paperless environment for researchers and students investigating or studying such models and algebraic structures in particular. To implement a first-order theory in the system, a suitable first-order language.( and some axioms are required. The components of a language are given by a collection of variables, a set of predicate symbols, and a set of operation symbols. Variables and operation symbols are used to build terms. Terms, predicate symbols, and the usual logical connectives are used to build formulas. A first-order theory now consists of a language together with a set of closed formulas, i.e. formulas without free occurrences of variables. The set of formulas is also called the axioms of the theory. The system uses several different formats to allow the user to specify languages, to define axioms and theories and to create models. Besides the obvious operations and tests on these structures, we have introduced the notion of a functor between classes of models in order to generate more co~plex models from given ones automatically. As an example, we will use the system to create several lattices structures starting from a model of the theory of pre-orders.
Resumo:
In this work we consider several instances of the following problem: "how complicated can the isomorphism relation for countable models be?"' Using the Borel reducibility framework, we investigate this question with regard to the space of countable models of particular complete first-order theories. We also investigate to what extent this complexity is mirrored in the number of back-and-forth inequivalent models of the theory. We consider this question for two large and related classes of theories. First, we consider o-minimal theories, showing that if T is o-minimal, then the isomorphism relation is either Borel complete or Borel. Further, if it is Borel, we characterize exactly which values can occur, and when they occur. In all cases Borel completeness implies lambda-Borel completeness for all lambda. Second, we consider colored linear orders, which are (complete theories of) a linear order expanded by countably many unary predicates. We discover the same characterization as with o-minimal theories, taking the same values, with the exception that all finite values are possible except two. We characterize exactly when each possibility occurs, which is similar to the o-minimal case. Additionally, we extend Schirrman's theorem, showing that if the language is finite, then T is countably categorical or Borel complete. As before, in all cases Borel completeness implies lambda-Borel completeness for all lambda.
Resumo:
In this work, we analyze systems described by Lagrangians with higher order derivatives in the context of the Hamilton-Jacobi formalism for first order actions. Two different approaches are studied here: the first one is analogous to the description of theories with higher derivatives in the hamiltonian formalism according to [D.M. Gitman, S.L. Lyakhovich, I.V. Tyutin, Soviet Phys. J. 26 (1983) 730; D.M. Gitman, I.V. Tyutin, Quantization of Fields with Constraints, Springer-Verlag, New York, Berlin, 1990] the second treats the case where degenerate coordinate are present, in an analogy to reference [D.M. Gitman, I.V. Tyutin, Nucl. Phys. B 630 (2002) 509]. Several examples are analyzed where a comparison between both approaches is made. (C) 2007 Elsevier B.V. All rights reserved.
Resumo:
Part of network management is collecting information about the activities that go on around a distributed system and analyzing it in real time, at a deferred moment, or both. The reason such information may be stored in log files and analyzed later is to data-mine it so that interesting, unusual, or abnormal patterns can be discovered. In this paper we propose defining patterns in network activity logs using a dialect of First Order Temporal Logics (FOTL), called First Order Temporal Logic with Duration Constrains (FOTLDC). This logic is powerful enough to describe most network activity patterns because it can handle both causal and temporal correlations. Existing results for data-mining patterns with similar structure give us the confidence that discovering DFOTL patterns in network activity logs can be done efficiently.
Resumo:
The field of chemical kinetics is an exciting and active field. The prevailing theories make a number of simplifying assumptions that do not always hold in actual cases. Another current problem concerns a development of efficient numerical algorithms for solving the master equations that arise in the description of complex reactions. The objective of the present work is to furnish a completely general and exact theory of reaction rates, in a form reminiscent of transition state theory, valid for all fluid phases and also to develop a computer program that can solve complex reactions by finding the concentrations of all participating substances as a function of time. To do so, the full quantum scattering theory is used for deriving the exact rate law, and then the resulting cumulative reaction probability is put into several equivalent forms that take into account all relativistic effects if applicable, including one that is strongly reminiscent of transition state theory, but includes corrections from scattering theory. Then two programs, one for solving complex reactions, the other for solving first order linear kinetic master equations to solve them, have been developed and tested for simple applications.
Resumo:
The long performance of an isothermal fixed bed reactor undergoing catalyst poisoning is theoretically analyzed using the dispersion model. First order reaction with dth order deactivation is assumed and the model equations are solved by matched asymptotic expansions for large Peclet number. Simple closed-form solutions, uniformly valid in time, are obtained.
Resumo:
The truncation errors associated with finite difference solutions of the advection-dispersion equation with first-order reaction are formulated from a Taylor analysis. The error expressions are based on a general form of the corresponding difference equation and a temporally and spatially weighted parametric approach is used for differentiating among the various finite difference schemes. The numerical truncation errors are defined using Peclet and Courant numbers and a new Sink/Source dimensionless number. It is shown that all of the finite difference schemes suffer from truncation errors. Tn particular it is shown that the Crank-Nicolson approximation scheme does not have second order accuracy for this case. The effects of these truncation errors on the solution of an advection-dispersion equation with a first order reaction term are demonstrated by comparison with an analytical solution. The results show that these errors are not negligible and that correcting the finite difference scheme for them results in a more accurate solution. (C) 1999 Elsevier Science B.V. All rights reserved.
Resumo:
Agências Financiadoras: FCT e MIUR
Resumo:
En aquest treball s'analitza la contribució estèrica de les molècules a les seves propietats químiques i físiques, mitjançant l'avaluació del seu volum i de la seva mesura de semblança, a partir d'ara definits com a descriptors moleculars de primer ordre. La difeèsncia entre aquests dos conceptes ha estat aclarida: mentre que el volum és la magnitud de l'espai que ocupa la molècula com a entitat global, la mesura de semblança ens dóna una idea de com està distribuïda la densitat electrònica al llarg d'aquest volum, i reflecteix més les diferències locals existents. L'ús de diverses aproximacions per a l'obtenció d'ambdós valors ha estat analitzat sobre diferents classes d'isòmers
Resumo:
Aquest projecte es centra principalment en el detector no coherent d’un GPS. Per tal de caracteritzar el procés de detecció d’un receptor, es necessita conèixer l’estadística implicada. Pel cas dels detectors no coherents convencionals, l’estadística de segon ordre intervé plenament. Les prestacions que ens dóna l’estadística de segon ordre, plasmada en la ROC, són prou bons tot i que en diferents situacions poden no ser els millors. Aquest projecte intenta reproduir el procés de detecció mitjançant l’estadística de primer ordre com a alternativa a la ja coneguda i implementada estadística de segon ordre. Per tal d’aconseguir-ho, s’usen expressions basades en el Teorema Central del Límit i de les sèries Edgeworth com a bones aproximacions. Finalment, tant l’estadística convencional com l’estadística proposada són comparades, en termes de la ROC, per tal de determinar quin detector no coherent ofereix millor prestacions en cada situació.
Resumo:
We propose an iterative procedure to minimize the sum of squares function which avoids the nonlinear nature of estimating the first order moving average parameter and provides a closed form of the estimator. The asymptotic properties of the method are discussed and the consistency of the linear least squares estimator is proved for the invertible case. We perform various Monte Carlo experiments in order to compare the sample properties of the linear least squares estimator with its nonlinear counterpart for the conditional and unconditional cases. Some examples are also discussed
Resumo:
We consider systems that can be described in terms of two kinds of degree of freedom. The corresponding ordering modes may, under certain conditions, be coupled to each other. We may thus assume that the primary ordering mode gives rise to a diffusionless first-order phase transition. The change of its thermodynamic properties as a function of the secondary-ordering-mode state is then analyzed. Two specific examples are discussed. First, we study a three-state Potts model in a binary system. Using mean-field techniques, we obtain the phase diagram and different properties of the system as a function of the distribution of atoms on the different lattice sites. In the second case, the properties of a displacive structural phase transition of martensitic type in a binary alloy are studied as a function of atomic order. Because of the directional character of the martensitic-transition mechanism, we find only a very weak dependence of the entropy on atomic order. Experimental results are found to be in quite good agreement with theoretical predictions.
Resumo:
We study the behavior of the random-bond Ising model at zero temperature by numerical simulations for a variable amount of disorder. The model is an example of systems exhibiting a fluctuationless first-order phase transition similar to some field-induced phase transitions in ferromagnetic systems and the martensitic phase transition appearing in a number of metallic alloys. We focus on the study of the hysteresis cycles appearing when the external field is swept from positive to negative values. By using a finite-size scaling hypothesis, we analyze the disorder-induced phase transition between the phase exhibiting a discontinuity in the hysteresis cycle and the phase with the continuous hysteresis cycle. Critical exponents characterizing the transition are obtained. We also analyze the size and duration distributions of the magnetization jumps (avalanches).
Resumo:
We study the driving-rate and temperature dependence of the power-law exponents that characterize the avalanche distribution in first-order phase transitions. Measurements of acoustic emission in structural transitions in Cu-Zn-Al and Cu-Al-Ni are presented. We show how the observed behavior emerges within a general framework of competing time scales of avalanche relaxation, driving rate, and thermal fluctuations. We confirm our findings by numerical simulations of a prototype model.