Literatura científica selecionada sobre o tema "Quantifier alternation"

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Quantifier alternation".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Quantifier alternation"

1

Benmamoun, Elabbas. "The Syntax of Quantifiers and Quantifier Float". Linguistic Inquiry 30, n.º 4 (outubro de 1999): 621–42. http://dx.doi.org/10.1162/002438999554237.

Texto completo da fonte
Resumo:
The Arabic quantifier kull displays a Q___NP and NP___Q alternation. Shlonsky (1991) argues that in both patterns Q heads a QP projection with the NP as a complement that may undergo movement to [Spec, QP] or beyond to yield the NP___Q pattern and Q-float structures. On the contrary, I argue on the basis of evidence from reconstruction, Case, and agreement that the two patterns are radically different. In the Q___NP pattern Q is indeed the head of a QP projection that contains the NP. In the NP___Q pattern, however, Q heads a QP adjunct that modifies the NP and in some cases the VP.
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Huumo, Tuomas. "Layers of (un)boundedness: The aspectual–quantificational interplay of quantifiers and partitive case in Finnish object arguments". Linguistics 58, n.º 3 (26 de maio de 2020): 905–36. http://dx.doi.org/10.1515/ling-2020-0084.

Texto completo da fonte
Resumo:
AbstractI present an account of the interplay between quantifiers and the partitive–accusative case alternation in Finnish object marking, with special reference to the aspectual and quantificational semantics of the clause. The case alternation expresses two oppositions (in affirmative clauses): (a) bounded (accusative) vs. unbounded (partitive) quantity, (b) culminating (accusative) vs. non-culminating (partitive) aspect. The quantifiers analyzed are of two main types: (i) mass quantifiers (e. g., paljon ‘a lot of’, vähän ‘(a) little’), which quantify a mass expressed by a mass noun or a plural form, (ii) number quantifiers (e. g., moni ‘many’, usea ‘a number of’), which quantify a multiplicity of discrete entities expressed by a count noun in the singular or plural. Finnish mass quantifiers only quantify nominals in the partitive, while number quantifiers agree with the quantified nominal in number and case and are used throughout the case paradigm. With a mass quantifier, the partitive form of the quantified nominal expresses unbounded quantity, which the quantifier then renders bounded (quantized). This is why object phrases with mass quantifiers behave like accusative objects: they express a bounded quantity together with culminating aspect. Number quantifiers quantify both accusative and partitive objects, in the singular and plural. Such objects are able to express aspect and quantity at two levels: (i) that of the individual component events which concern one entity each; (ii) that of the higher-order event which concerns the whole quantity expressed. I argue that the case marking of the object relates primarily to level (i), while the meaning of the number quantifier relates to level (ii). This is why a number quantifier typically renders the quantity bounded and the aspect culminating at level (ii), even when the partitive case expresses unboundedness or lack of culmination at level (i).
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Pikhurko, Oleg, Joel Spencer e Oleg Verbitsky. "Decomposable graphs and definitions with no quantifier alternation". European Journal of Combinatorics 28, n.º 8 (novembro de 2007): 2264–83. http://dx.doi.org/10.1016/j.ejc.2007.04.016.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Zhukovskii, M. E. "Quantifier Alternation in First-Order Formulas with Infinite Spectra". Problems of Information Transmission 53, n.º 4 (15 de abril de 2017): 391–403. http://dx.doi.org/10.1134/s003294601704007x.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Matz, Oliver, Nicole Schweikardt e Wolfgang Thomas. "The Monadic Quantifier Alternation Hierarchy over Grids and Graphs". Information and Computation 179, n.º 2 (dezembro de 2002): 356–83. http://dx.doi.org/10.1006/inco.2002.2955.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Kufleitner, Manfred, e Tobias Walter. "Level Two of the Quantifier Alternation Hierarchy Over Infinite Words". Theory of Computing Systems 62, n.º 3 (4 de agosto de 2017): 467–80. http://dx.doi.org/10.1007/s00224-017-9801-x.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Kufleitner, Manfred, e Tobias Walter. "One quantifier alternation in first-order logic with modular predicates". RAIRO - Theoretical Informatics and Applications 49, n.º 1 (janeiro de 2015): 1–22. http://dx.doi.org/10.1051/ita/2014024.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Place, Thomas, e Marc Zeitoun. "Going Higher in First-Order Quantifier Alternation Hierarchies on Words". Journal of the ACM 66, n.º 2 (26 de abril de 2019): 1–65. http://dx.doi.org/10.1145/3303991.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Pikhurko, Oleg, e Oleg Verbitsky. "Descriptive complexity of finite structures: Saving the quantifier rank". Journal of Symbolic Logic 70, n.º 2 (junho de 2005): 419–50. http://dx.doi.org/10.2178/jsl/1120224721.

Texto completo da fonte
Resumo:
AbstractWe say that a first order formula Φ distinguishes a structure M over a vocabulary L from another structure M′ over the same vocabulary if Φ is true on M but false on M′. A formula Φ defines an L-structure M if Φ distinguishes M from any other non-isomorphic L-structure M′. A formula Φ identifies an n-element L-structure M if Φ distinguishes M from any other non-isomorphic n-element L-structure M′.We prove that every n-element structure M is identifiable by a formula with quantifier rank less than and at most one quantifier alternation, where k is the maximum relation arity of M. Moreover, if the automorphism group of M contains no transposition of two elements, the same result holds for definability rather than identification.The Bernays-Schönfinkel class consists of prenex formulas in which the existential quantifiers all precede the universal quantifiers. We prove that every n-element structure M is identifiable by a formula in the Bernays-Schönfinkel class with less than quantifiers. If in this class of identifying formulas we restrict the number of universal quantifiers to k, then less than quantifiers suffice to identify M and. as long as we keep the number of universal quantifiers bounded by a constant, at total quantifiers are necessary.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Keisler, H. Jerome, e Wafik Boulos Lotfallah. "First order quantifiers in monadic second order logic". Journal of Symbolic Logic 69, n.º 1 (março de 2004): 118–36. http://dx.doi.org/10.2178/jsl/1080938831.

Texto completo da fonte
Resumo:
AbstractThis paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01].We introduce an operation existsn (S) on properties S that says “there are n components having S”. We use this operation to show that under natural strictness conditions, adding a first order quantifier word u to the beginning of a prefix class V increases the expressive power monotonically in u. As a corollary, if the first order quantifiers are not already absorbed in V, then both the quantifier alternation hierarchy and the existential quantifier hierarchy in the positive first order closure of V are strict.We generalize and simplify methods from Marcinkowski [Mar99] to uncover limitations of the expressive power of an additional first order quantifier, and show that for a wide class of properties S, S cannot belong to the positive first order closure of a monadic prefix class W unless it already belongs to W.We introduce another operation alt(S) on properties which has the same relationship with the Circuit Value Problem as reach(S) (defined in [JM01]) has with the Directed Reachability Problem. We use alt(S) to show that Πn ⊈ FO(Σn), Σn ⊈ FO(∆n). and ∆n+1 ⊈ FOB(Σn), solving some open problems raised in [Mat98].
Estilos ABNT, Harvard, Vancouver, APA, etc.

Teses / dissertações sobre o assunto "Quantifier alternation"

1

Więckowski, Bartosz. "Modality without reference an alternative semantics for substitutional quantified modal logic and its philosophical significance /". [S.l. : s.n.], 2006.

Encontre o texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Więckowski, Bartosz [Verfasser]. "Modality without reference : an alternative semantics for substitutional quantified modal logic and its philosophical significance / vorgelegt von Bartosz Wiȩckowski". 2007. http://d-nb.info/983714568/34.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.

Livros sobre o assunto "Quantifier alternation"

1

Azzouni, Jody. Transcendence and Immanence. Oxford University Press, 2017. http://dx.doi.org/10.1093/oso/9780190622558.003.0001.

Texto completo da fonte
Resumo:
Current metaphysical debates (between, e.g., Hirsch, Sider, Hawthorne, and others) are historically centered in an earlier debate between Carnap and Quine. This was a debate over whether formal languages can function as replacements for natural language or whether instead they offer techniques that can be used to modify natural languages. This debate continues to be relevant to contemporary debates between Hirsch and his opponents. Hirsch presupposes the natural-language-centered Quinean position; many of his opponents take Ontologese to be a cogent alternative for metaphysical discourse. In addition, it’s shown that Hirsch’s attempts to demarcate substantial from purely verbal debates derail because of the technical failure to show that finitely specified sentence-to-sentence mappings between disputant claims are available. It’s shown further that quantifier-variant views make no sense of ontological debate. Participants in ontological debate need to share an existence concept if they are to argue successfully with one another.
Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Quantifier alternation"

1

Pierron, Théo, Thomas Place e Marc Zeitoun. "Quantifier Alternation for Infinite Words". In Lecture Notes in Computer Science, 234–51. Berlin, Heidelberg: Springer Berlin Heidelberg, 2016. http://dx.doi.org/10.1007/978-3-662-49630-5_14.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Bradfield, J. C. "Fixpoint Alternation and the Game Quantifier". In Computer Science Logic, 350–61. Berlin, Heidelberg: Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48168-0_25.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Kufleitner, Manfred, e Pascal Weil. "On FO 2 Quantifier Alternation over Words". In Mathematical Foundations of Computer Science 2009, 513–24. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-03816-7_44.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Zhang, Ting, Henny B. Sipma e Zohar Manna. "Term Algebras with Length Function and Bounded Quantifier Alternation". In Lecture Notes in Computer Science, 321–36. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-30142-4_23.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Schweikardt, Nicole. "The monadic quantifier alternation hierarchy over grids and pictures". In Computer Science Logic, 441–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0028030.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Kufleitner, Manfred, e Tobias Walter. "Level Two of the Quantifier Alternation Hierarchy over Infinite Words". In Computer Science – Theory and Applications, 223–36. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-34171-2_16.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Matz, Oliver. "Dot-Depth and Monadic Quantifier Alternation over Pictures — Extended Abstract". In Ausgezeichnete Informatikdissertationen 1999, 169–78. Wiesbaden: Vieweg+Teubner Verlag, 2000. http://dx.doi.org/10.1007/978-3-322-84823-9_16.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Place, Thomas, e Marc Zeitoun. "Going Higher in the First-Order Quantifier Alternation Hierarchy on Words". In Automata, Languages, and Programming, 342–53. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-43951-7_29.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Ly, Olivier. "The Bounded Weak Monadic Quantifier Alternation Hierarchy of Equational Graphs Is Infinite". In FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science, 188–200. Berlin, Heidelberg: Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/3-540-44450-5_15.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Yu, Emily, Armin Biere e Keijo Heljanko. "Progress in Certifying Hardware Model Checking Results". In Computer Aided Verification, 363–86. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-81688-9_17.

Texto completo da fonte
Resumo:
AbstractWe present a formal framework to certify k-induction-based model checking results. The key idea is the notion of a k-witness circuit which simulates the given circuit and has a simple inductive invariant serving as proof certificate. Our approach allows to check proofs with an independent proof checker by reducing the certification problem to pure SAT checks and checking a simple QBF with one quantifier alternation. We also present Certifaiger, the resulting certification toolkit, and evaluate it on instances from the hardware model checking competition. Our experiments show the practical use of our certification method.
Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Quantifier alternation"

1

Thérien, Denis, e Thomas Wilke. "Over words, two variables are as powerful as one quantifier alternation". In the thirtieth annual ACM symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/276698.276749.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
2

Steedman, Mark. "Alternating quantifier scope in CCG". In the 37th annual meeting of the Association for Computational Linguistics. Morristown, NJ, USA: Association for Computational Linguistics, 1999. http://dx.doi.org/10.3115/1034678.1034728.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
3

Place, Thomas. "Separating Regular Languages with Two Quantifiers Alternations". In 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2015. http://dx.doi.org/10.1109/lics.2015.28.

Texto completo da fonte
Estilos ABNT, Harvard, Vancouver, APA, etc.
4

Hu, Jie, e Yan Wang. "Sensitivity Analysis in Quantified Interval Constraint Satisfaction Problems". In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-12460.

Texto completo da fonte
Resumo:
Interval is an alternative to probability distribution in quantifying epistemic uncertainty for reliability analysis when there is a lack of data to fit a distribution with good confidence. It only requires the information of lower and upper bounds. The propagation of uncertainty is analyzed by solving interval-valued constraint satisfaction problems (CSPs). By introducing logic quantifiers, quantified constraint satisfaction problems (QCSPs) can capture more semantics and engineering intent than CSPs. Sensitivity analysis (SA) takes into account of variations associated with the structure and parameters of interval constraints to study to which extent they affect the output. In this paper, a global SA method is developed for QCSPs, where the effects of quantifiers and interval ranges on the constraints are analyzed based on several proposed metrics, which indicate the levels of indeterminacy for inputs and outputs as well as unsatisfiability of constraints. Two vehicle design problems are used to demonstrate the proposed approach.
Estilos ABNT, Harvard, Vancouver, APA, etc.
5

Foster, Garrett, e Scott Ferguson. "Assessing the Effectiveness of Using Graveyard Data for Generating Design Alternatives". In ASME 2011 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2011. http://dx.doi.org/10.1115/detc2011-48636.

Texto completo da fonte
Resumo:
Modeling to Generate Alternatives (MGA) is a technique used to identify variant designs that maximize design space distance from an initial point while satisfying performance loss constraints. Recent work has explored the application of this technique to nonlinear design problems, where the design space was investigated using an exhaustive sampling procedure. While computational cost concerns were noted, the main focus was determining how scaling and distance metric selection influenced alternative discovery. To increase the viability of MGA for engineering design problems, this work looks to reduce the computational overhead needed to identify design alternatives. This paper investigates and quantifies the effectiveness of using previously sampled designs, i.e. a graveyard, from a multiobjective genetic algorithm as a means of reducing computational expense. Computational savings and the expected error are quantified to assess the effectiveness of this approach. These results are compared to other more common “search” techniques; namely Latin hypercube samplings, grid search, and the Nelder-Mead simplex method. The performance of these “search” techniques are subsequently explored in two case study problems — the design of a two bar truss, and an I-beam — to find the most unique alternative design over a range of different thresholds. Results from this work show the graveyard can be used as a way of inexpensively generating alternatives that are close to ideal, especially nearer to the starting design. Additionally, this paper demonstrates that graveyard information can be used to increase the performance of the Nelder-Mead simplex method when searching for alternative designs.
Estilos ABNT, Harvard, Vancouver, APA, etc.
6

Sarver, Joseph J., e Dawn M. Elliott. "An Alternative Method for Determining the Neutral Zone of Spinal Motion Segment Units". In ASME 2003 International Mechanical Engineering Congress and Exposition. ASMEDC, 2003. http://dx.doi.org/10.1115/imece2003-43058.

Texto completo da fonte
Resumo:
In-vitro mechanical testing of spinal motion segments has the potential to provide insight into mechanisms of intervertebral disc degeneration as well as a means for evaluating treatments. We describe a novel tri-linear method for quantifying the non-linear load-displacement behavior which is robust across different spinal levels, and quantifies stiffness at low-loads, which has not been included by previous threshold based methods. Mechanical data from in-vitro compression/tension testing of rodent motion segments is used to compare our tri-linear method with a threshold based method, and demonstrates that our method is insensitive to spinal level as well as provides constitutive information for low-load behavior.
Estilos ABNT, Harvard, Vancouver, APA, etc.
7

Luan, Siyao, Deborah L. Thurston, Madhav Arora e James T. Allison. "Developing and Comparing Alternative Design Optimization Formulations for a Vibration Absorber Example". In ASME 2017 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2017. http://dx.doi.org/10.1115/detc2017-68337.

Texto completo da fonte
Resumo:
In some cases, the level of effort required to formulate and solve an engineering design problem as a mathematical optimization problem is significant, and the potential improved design performance may not be worth the excessive effort. In this article we address the tradeoffs associated with formulation and modeling effort. Here we define three core elements (dimensions) of design formulations: design representation, comparison metrics, and predictive model. Each formulation dimension offers opportunities for the design engineer to balance the expected quality of the solution with the level of effort and time required to reach that solution. This paper demonstrates how using guidelines can be used to help create alternative formulations for the same underlying design problem, and then how the resulting solutions can be evaluated and compared. Using a vibration absorber design example, the guidelines are enumerated, explained, and used to compose six alternative optimization formulations, featuring different objective functions, decision variables, and constraints. The six alternative optimization formulations are subsequently solved, and their scores reflecting their complexity, computational time, and solution quality are quantified and compared. The results illustrate the unavoidable tradeoffs among these three attributes. The best formulation depends on the set of tradeoffs that are best in that situation.
Estilos ABNT, Harvard, Vancouver, APA, etc.
8

Vukadinovic, Vlade, Peter Habisreuther e Nikolaos Zarzalis. "Experimental Study on Combustion Characteristics of Conventional and Alternative Liquid Fuels". In ASME Turbo Expo 2012: Turbine Technical Conference and Exposition. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/gt2012-69449.

Texto completo da fonte
Resumo:
Gas turbine combustor design relies strongly on the turbulent flame velocity over the whole turbine operation range. Due to the fact that turbulent flame velocity depends strongly on the laminar one, its characterisation at different thermodynamic conditions is necessary for further optimisation of gas turbines. The Markstein number, which quantifies the response of the flame to the stretch, also has to be considered. Additionally, the Markstein number can be utilised as an indicator for laminar and turbulent flame front stability. The current attempts to replace conventional fuels, such as kerosene, with alternative ones, obtrude their comparison in order to find the most appropriate substitute. Additionally, significant differences in the flame behaviour, which could be recognised through different combustion characteristics, can lead to modification of currently used gas turbine design. Even so, the experimental data of alternative fuels are scarce, especially at elevated pressure conditions. So, the combustion characteristics, laminar burning velocity and Markstein number of kerosene Jet A-1 and several alternative fuels (GTL and GTL blends) are investigated experimentally in an explosion vessel. For this purpose an optical laser method is employed based on the Mie-scattering of the laser light by smoke particles. Within this experimental study the influence of three crucial parameters: initial temperature, initial pressure and mixture composition on the burning velocity and Markstein number are investigated. The experiments were performed at three different pressures 1, 2, 4bar; three different temperatures 100°C, 150°C, 200°C; and for a range of equivalence ratio 0.67–1.67. The observed results are compared and discussed in detail.
Estilos ABNT, Harvard, Vancouver, APA, etc.
9

Barrozo, Marcos A. S., N. C. Silva, T. C. Silva, A. O. Santos, I. S. Graton e C. R. Duarte. "Drying of microalga Spirulina platensis in a rotary dryer with inert bed". In 21st International Drying Symposium. Valencia: Universitat Politècnica València, 2018. http://dx.doi.org/10.4995/ids2018.2018.7457.

Texto completo da fonte
Resumo:
The aim of this work is investigate the use of a rotary dryer with inert bed for drying of microalga Spirulina platensis. The influence of air temperature, feed rate, rotation speed and inerts filling degree was quantified. The contents of main bioactive compounds were also analyzed. The results shown that the used drying system proved to be an interesting alternative for a possible use of this microalga, if performed under adequate conditions. It was identified conditions with high drying performance and with the preservation of product quality.Keywords: Spirulina platensis; rotary dryer; inert bed; bioactive compounds.
Estilos ABNT, Harvard, Vancouver, APA, etc.
10

Xiong, Qingwen, Junli Gou e Jianqiang Shan. "Investigation on Methods for Uncertainty Quantification of Constitutive Models and the Application in BEPU". In 2018 26th International Conference on Nuclear Engineering. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/icone26-81425.

Texto completo da fonte
Resumo:
The best estimate plus uncertainty (BEPU) method is recommended by IAEA for nuclear safety analysis. Most of the existing BEPU methodologies rely on the uncertainty propagation of input parameters, while uncertainties of the constitutive models in best estimate codes tend not to be valued or even neglected. A structural method is proposed in this paper to quantify the uncertainties of the constitutive models. Different constitutive models will be classified according to the characteristics and corresponding method could be utilized for each model based on the method. Specific uncertainty quantification (UQ) methods adopted in this paper include the non-parametric curve estimation method, inverse method and design of experiment (DOE) method, and a model selection technique is adopted to opt the optimal model among all alternative models. The structural method is applied to the uncertainty evaluation of LOFT LP-02-6 experiment. Important models are identified, uncertainties of these models are quantified and propagated to the peak cladding temperature (PCT) through code calculations. Uncertainty of the PCT is quantified and the result shows that the calculated values could well envelop the experimental value.
Estilos ABNT, Harvard, Vancouver, APA, etc.
Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!

Vá para a bibliografia