Relevant bibliographies by topics / Finite model theory

Academic literature on the topic 'Finite model theory'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 January 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Finite model theory.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Finite model theory"

1

Chatzidakis, Zoé. "Model theory of finite fields and pseudo-finite fields." Annals of Pure and Applied Logic 88, no. 2-3 (November 1997): 95–108. http://dx.doi.org/10.1016/s0168-0072(97)00017-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Lotfallah, Wafik Boulos. "Strong convergence in finite model theory." Journal of Symbolic Logic 67, no. 3 (September 2002): 1083–92. http://dx.doi.org/10.2178/jsl/1190150151.

Full text
Abstract:
AbstractIn [9] we introduced a new framework for asymptotic probabilities, in which a σ-additive measure is defined on the sample space of all sequences of finite models, where the universe of , is {1,2,…,n}. In this framework we investigated the strong 0-1 law for sentences, which states that each sentence either holds in eventually almost surely or fails in eventually almost surely.In this paper we define the strong convergence law for formulas, which carries over the ideas of the strong 0-1 law to formulas with free variables, and roughly states that for each formula ϕ(x), the fraction of tuples a in , which satisfy the formula ϕ(x), almost surely has a limit as n tends to infinity.We show that the infinitary logic with finitely many variables has the strong convergence law for formulas for the uniform measure, and further characterize the measures on random graphs for which the strong convergence law holds.
APA, Harvard, Vancouver, ISO, and other styles
3

Fagin, Ronald. "Finite-model theory - a personal perspective." Theoretical Computer Science 116, no. 1 (August 1993): 3–31. http://dx.doi.org/10.1016/0304-3975(93)90218-i.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Djordjević, Marko. "Finite variable logic, stability and finite models." Journal of Symbolic Logic 66, no. 2 (June 2001): 837–58. http://dx.doi.org/10.2307/2695048.

Full text
Abstract:
We will study complete Ln-theories and their models, where Ln is the set of first order formulas in which at most n distinct variables occur. Here, by a complete Ln-theory we mean a theory such that for every Ln-sentence, it or its negation is implied by the theory. Hence, a complete Ln-theory need not necessarily be complete in the usual sense. Our approach is to transfer concepts and methods from stability theory, such as the order property and counting types, to the context of Ln-theories. So, in one sense, we will develop some rudimentary stability theory for a particular class of (possibly) incomplete theories. To make the ‘stability theoretic’ arguments work, we need to assume that models of the complete Ln-theory T which we consider can be amalgamated in certain ways. If this condition is satisfied and T has infinite models then there will exist models of T which are sufficiently saturated with respect to Ln. This allows us to use some counting types arguments from stability theory. If, moreover, we impose some finiteness conditions on the number of Ln-types and the length of Ln-definable orders then a sufficiently saturated model of T will be ω-categorical and ω-stable. Using the theory of ω-categorical and ω-stable structures we derive that T has arbitrarily large finite models.A different approach to combining stability theory with finite model theory is made by Hyttinen in [9] and [10].
APA, Harvard, Vancouver, ISO, and other styles
5

Dawar, Anuj. "FINITE MODEL THEORY (Perspectives in Mathematical Logic)." Bulletin of the London Mathematical Society 29, no. 4 (July 1997): 504–5. http://dx.doi.org/10.1112/s0024609396222416.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Macpherson, Dugald. "Model theory of finite and pseudofinite groups." Archive for Mathematical Logic 57, no. 1-2 (September 19, 2017): 159–84. http://dx.doi.org/10.1007/s00153-017-0584-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Alfaro, Jorge, Pablo González, and Ricardo Avila. "A finite quantum gravity field theory model." Classical and Quantum Gravity 28, no. 21 (October 12, 2011): 215020. http://dx.doi.org/10.1088/0264-9381/28/21/215020.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Eberl, Matthias. "A Model Theory for the Potential Infinite." Reports on Mathematical Logic 57 (November 28, 2022): 3–30. http://dx.doi.org/10.4467/20842589rm.22.001.16658.

Full text
Abstract:
We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely extensible finite. The main adoption is the interpretation of the universal quantifier, which has an implicit reection principle. Each universal quantification refers to an indefinitely large, but finite set. The quantified sets may increase, so after a reference by quantification, a further reference typically uses a larger, still finite set. We present the concepts for classical first-order logic and show that these dynamic models are sound and complete with respect to the usual inference rules. Moreover, a finite set of formulas requires a finite part of the increasing model for a correct interpretation.
APA, Harvard, Vancouver, ISO, and other styles
9

Rosen, Eric. "Some Aspects of Model Theory and Finite Structures." Bulletin of Symbolic Logic 8, no. 3 (September 2002): 380–403. http://dx.doi.org/10.2178/bsl/1182353894.

Full text
Abstract:
Model theory is concerned mainly, although not exclusively, with infinite structures. In recent years, finite structures have risen to greater prominence, both within the context of mainstream model theory, e.g., in work of Lachlan, Cherlin, Hrushovski, and others, and with the advent of finite model theory, which incorporates elements of classical model theory, combinatorics, and complexity theory. The purpose of this survey is to provide an overview of what might be called the model theory of finite structures. Some topics in finite model theory have strong connections to theoretical computer science, especially descriptive complexity theory (see [26, 46]). In fact, it has been suggested that finite model theory really is, or should be, logic for computer science. These connections with computer science will, however, not be treated here.It is well-known that many classical results of ‘infinite model theory’ fail over the class of finite structures, including the compactness and completeness theorems, as well as many preservation and interpolation theorems (see [35, 26]). The failure of compactness in the finite, in particular, means that the standard proofs of many theorems are no longer valid in this context. At present, there is no known example of a classical theorem that remains true over finite structures, yet must be proved by substantially different methods. It is generally concluded that first-order logic is ‘badly behaved’ over finite structures.From the perspective of expressive power, first-order logic also behaves badly: it is both too weak and too strong. Too weak because many natural properties, such as the size of a structure being even or a graph being connected, cannot be defined by a single sentence. Too strong, because every class of finite structures with a finite signature can be defined by an infinite set of sentences. Even worse, every finite structure is defined up to isomorphism by a single sentence. In fact, it is perhaps because of this last point more than anything else that model theorists have not been very interested in finite structures. Modern model theory is concerned largely with complete first-order theories, which are completely trivial here.
APA, Harvard, Vancouver, ISO, and other styles
10

Lotfallah, Wafik Boulos. "Strong 0-1 laws in finite model theory." Journal of Symbolic Logic 65, no. 4 (December 2000): 1686–704. http://dx.doi.org/10.2307/2695069.

Full text
Abstract:
AbstractWe introduce a new framework for asymptotic probabilities of sentences, in which we have a σ-additive measure on the sample space of all sequences A = {} of finite models, where the universe of is {1,2, …, n}. and use this framework to strengthen 0-1 laws for logics.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Finite model theory"

1

Bello, Aguirre Ricardo Isaac. "Model theory of finite and pseudofinite rings." Thesis, University of Leeds, 2016. http://etheses.whiterose.ac.uk/15771/.

Full text
Abstract:
The model theory of finite and pseudofinite fields as well as the model theory of finite and pseudofinite groups have been and are thoroughly studied. A close relation has been found between algebraic and model theoretic properties of pseudofinite fields and psedudofinite groups. In this thesis we present results contributing to the beginning of the study of model theory of finite and pseudofinite rings. In particular we classify the theory of ultraproducts of finite residue rings in the context of generalised stability theory. We give sufficient and necessary conditions for the theory of such ultraproducts to be NIP, simple, NTP2 but not simple nor NIP, or TP2 . Further, we show that for any fixed positive l in N the class of finite residue rings {Zp=p^l Zp : p in P} forms an l-dimensional asymptotic class. We discuss related classes of finite residue rings in the context of R-multidimensional asymptotic classes. Finally we present a classification of simple and semisimple (in the algebraic sense) pseudofinite rings, we study NTP2 classes of J-semisimple rings and we discuss NIP classes of finite rings and ultraproducts of these NIP classes.
APA, Harvard, Vancouver, ISO, and other styles
2

Block, Max. "Undecidability of finite satisfiability and characterization of NP in finite model theory." Thesis, Uppsala universitet, Algebra och geometri, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-254570.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Gate, James Simon. "Applications of finite model theory : optimisation problems, hybrid modal logics and games." Thesis, Durham University, 2013. http://etheses.dur.ac.uk/7015/.

Full text
Abstract:
There exists an interesting relationships between two seemingly distinct fields: logic from the field of Model Theory, which deals with the truth of statements about discrete structures; and Computational Complexity, which deals with the classification of problems by how much of a particular computer resource is required in order to compute a solution. This relationship is known as Descriptive Complexity and it is the primary application of the tools from Model Theory when they are restricted to the finite; this restriction is commonly called Finite Model Theory. In this thesis, we investigate the extension of the results of Descriptive Complexity from classes of decision problems to classes of optimisation problems. When dealing with decision problems the natural mapping from true and false in logic to yes and no instances of a problem is used but when dealing with optimisation problems, other features of a logic need to be used. We investigate what these features are and provide results in the form of logical frameworks that can be used for describing optimisation problems in particular classes, building on the existing research into this area. Another application of Finite Model Theory that this thesis investigates is the relative expressiveness of various fragments of an extension of modal logic called hybrid modal logic. This is achieved through taking the Ehrenfeucht-Fraïssé game from Model Theory and modifying it so that it can be applied to hybrid modal logic. Then, by developing winning strategies for the players in the game, results are obtained that show strict hierarchies of expressiveness for fragments of hybrid modal logic that are generated by varying the quantifier depth and the number of proposition and nominal symbols available.
APA, Harvard, Vancouver, ISO, and other styles
4

Ryten, Mark Jonathan. "Model theory of finite difference fields and simple groups." Thesis, University of Leeds, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.441226.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Hayashi, Masahito. "Asymptotic estimation theory for a finite dimensional pure state model." 京都大学 (Kyoto University), 1999. http://hdl.handle.net/2433/181932.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Morgan, Samuel Alexander. "A gapless theory of Bose-Einstein condensation in dilute gases at finite temperature." Thesis, University of Oxford, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.302178.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Lin, Dong. "Model-based cluster analysis using Bayesian techniques." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2008. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bhattacharyya, Anirban. "Application of effective field theory to density functional theory for finite systems." Connect to resource, 2005. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=osu1124116299.

Full text
Abstract:
Thesis (Ph. D.)--Ohio State University, 2005.
Title from first page of PDF file. Document formatted into pages; contains xv, 210 p.; also includes graphics (some col.). Includes bibliographical references (p. 205-210). Available online via OhioLINK's ETD Center
APA, Harvard, Vancouver, ISO, and other styles
9

Manikas, Vasileios. "A Bayesian Finite Mixture Model for Network-Telecommunication Data." Thesis, Stockholms universitet, Statistiska institutionen, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-146039.

Full text
Abstract:
A data modeling procedure called Mixture model, is introduced beneficial to the characteristics of our data. Mixture models have been proved flexible and easy to use, a situation which can be confirmed from the majority of papers and books which have been published the last twenty years. The models are estimated using a Bayesian inference through an efficient Markov Chain Monte Carlo (MCMC) algorithm, known as Gibbs Sampling. The focus of the paper is on models for network-telecommunication lab data (not time dependent data) and on the valid predictions we can accomplish. We categorize our variables (based on their distribution) in three cases, a mixture of Normal distributions with known allocation, a mixture of Negative Binomial Distributions with known allocations and a mixture of Normal distributions with unknown allocation.
APA, Harvard, Vancouver, ISO, and other styles
10

Groenewald, Hendrikus Wilhelm. "A non-commutative walecka model as an effective theory for interacting nucleons of finite size." Thesis, Stellenbosch : Stellenbosch University, 2012. http://hdl.handle.net/10019.1/20255.

Full text
Abstract:
Thesis (MSc)--Stellenbosch University, 2012.
ENGLISH ABSTRACT: The nite size of nucleons should play an important role in the description of high density nuclear matter as found in astro-physical objects. Yet we see that the Walecka model, which is generally used to describe these systems, treats the nucleons as point particles. Here we argue that a non-commutative version of the Walecka model may be a consistent and appropriate framework to describe nite nucleon size e ects. In this framework the length scale introduced through the non-commutative parameter plays the role of the nite nucleon size. To investigate the consequences of this description, the equations of motion and energy-momentum tensor for the non-commutative Walecka model are derived. We also derived an expression for the total energy of the system, as a function of the non-commutative parameter, in a spatially non-uniform matter approximation. The non-commutative parameter, as a variable dependent on the dynamics of the system, remains to be solved self-consistently.
AFRIKAANSE OPSOMMING: Die eindige grootte van nukleone moet 'n belangrike rol speel in die beskrywing van ho e-digtheid kern materie soos gevind in astro- siese voorwerpe. Tog sien ons dat die Walecka model, wat in die algemeen gebruik word om hierdie stelsels te beskryf, die nukleone as punt deeltjies hanteer. Ons redeneer dus dat 'n nie-kommutatiewe weergawe van die Walecka model 'n konsistente en gepaste raamwerk is om die e ekte van eindige nukleon grootte te beskryf. In hierdie raamwerk speel die lengte-skaal wat ingevoer word deur die nie-kommutatiewe parameter die rol van eindige grootte vir nukleone. Om die gevolge van hierdie beskrywing te ondersoek, word die vergelykings van beweging en die energie-momentum tensor afgelei vir die nie-kommutatiewe Walecka model. Ons het ook 'n uitdrukking vir die totale energie van die stelsel, as 'n funksie van die niekommutatiewe parameter, afgelei in 'n ruimtelik nie-uniforme materie benadering. Die niekommutatiewe parameter, as 'n veranderlike afhanklik van die dinamika van die stelsel, bly steeds om self-konsistent opgelos te word.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Finite model theory"

1

Ebbinghaus, Heinz-Dieter. Finite model theory. 2nd ed. Berlin: Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Ebbinghaus, Heinz-Dieter. Finite model theory. Berlin: Springer, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ebbinghaus, Heinz-Dieter, and Jörg Flum. Finite Model Theory. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/978-3-662-03182-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ebbinghaus, Heinz-Dieter, and Jörg Flum. Finite Model Theory. Berlin, Heidelberg: Springer Berlin Heidelberg, 1995. http://dx.doi.org/10.1007/3-540-28788-4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Esparza, Javier. Finite and algorithmic model theory. Cambridge: Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Libkin, Leonid. Elements of Finite Model Theory. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Finite and algorithmic model theory. Cambridge: Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Esparza, Javier, Christian Michaux, and Charles Steinhorn, eds. Finite and Algorithmic Model Theory. Cambridge: Cambridge University Press, 2009. http://dx.doi.org/10.1017/cbo9780511974960.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Libkin, Leonid. Elements of Finite Model Theory. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07003-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Borovik, Alexandre. Groups of finite Morley rank. Oxford: Clarendon Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Finite model theory"

1

Cherlin, Gregory. "Large Finite Structures with Few Types." In Algebraic Model Theory, 53–105. Dordrecht: Springer Netherlands, 1997. http://dx.doi.org/10.1007/978-94-015-8923-9_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Libkin, Leonid. "Finite Variable Logics." In Elements of Finite Model Theory, 211–34. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07003-1_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Libkin, Leonid. "Embedded Finite Models." In Elements of Finite Model Theory, 249–73. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07003-1_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vianu, Victor. "Databases and finite-model theory." In Descriptive Complexity and Finite Models, 97–148. Providence, Rhode Island: American Mathematical Society, 1997. http://dx.doi.org/10.1090/dimacs/031/04.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Wipf, Andreas. "Finite Temperature Schwinger Model." In Statistical Approach to Quantum Field Theory, 435–74. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-83263-6_16.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gelade, Wouter, and Thomas Schwentick. "Automata and finite model theory." In Handbook of Automata Theory, 1071–103. Zuerich, Switzerland: European Mathematical Society Publishing House, 2021. http://dx.doi.org/10.4171/automata-1/29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Libkin, Leonid. "Turing Machines and Finite Models." In Elements of Finite Model Theory, 165–76. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07003-1_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Libkin, Leonid. "Other Applications of Finite Model Theory." In Elements of Finite Model Theory, 275–89. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07003-1_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Libkin, Leonid. "Introduction." In Elements of Finite Model Theory, 1–11. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07003-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Libkin, Leonid. "Fixed Point Logics and Complexity Classes." In Elements of Finite Model Theory, 177–210. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-662-07003-1_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Finite model theory"

1

Kolaitis, Phokion G. "Reflections on Finite Model Theory." In 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007). IEEE, 2007. http://dx.doi.org/10.1109/lics.2007.39.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Abramsky, Samson, Anuj Dawar, and Pengming Wang. "The pebbling comonad in Finite Model Theory." In 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2017. http://dx.doi.org/10.1109/lics.2017.8005129.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Montacute, Yoàv, and Nihil Shah. "The Pebble-Relation Comonad in Finite Model Theory." In LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science. New York, NY, USA: ACM, 2022. http://dx.doi.org/10.1145/3531130.3533335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Libkin, Leonid. "The finite model theory toolbox of a database theoretician." In the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1559795.1559807.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Atserias, Albert. "A Why-on-Earth Tutorial on Finite Model Theory." In 2011 26th Annual IEEE Symposium on Logic in Computer Science (LICS 2011). IEEE, 2011. http://dx.doi.org/10.1109/lics.2011.52.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Cozman, Fabio Gagliardi, and Denis Deratani Mauá. "The Finite Model Theory of Bayesian Networks: Descriptive Complexity." In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/727.

Full text
Abstract:
We adapt the theory of descriptive complexity to Bayesian networks, to quantify the expressivity of specifications based on predicates and quantifiers. We show that Bayesian network specifications that employ first-order quantification capture the complexity class PP; by allowing quantification over predicates, the resulting Bayesian network specifications capture each class in the hierarchy PP^(NP^...^NP), a result that does not seem to have equivalent in the literature.
APA, Harvard, Vancouver, ISO, and other styles
7

Manzo, Mario, Giuseppe Lamanna, Francesco Di Caprio, Antonio Chiariello, Paul Schatrow, Matthias Waimer, and Nathalie Toso. "A simplified finite element model for crashworthiness investigations." In FRACTURE AND DAMAGE MECHANICS: Theory, Simulation and Experiment. AIP Publishing, 2020. http://dx.doi.org/10.1063/5.0034954.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Hong, Song-Nam, and Giuseppe Caire. "Two-unicast two-hop interference network: Finite-field model." In 2013 IEEE Information Theory Workshop (ITW 2013). IEEE, 2013. http://dx.doi.org/10.1109/itw.2013.6691339.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lohmayer, Robert, and Rajamani Narayanan. "Many-flavor Schwinger model at finite chemical potential." In 31st International Symposium on Lattice Field Theory LATTICE 2013. Trieste, Italy: Sissa Medialab, 2014. http://dx.doi.org/10.22323/1.187.0145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kieronski, Emanuel, and Sebastian Rudolph. "Finite Model Theory of the Triguarded Fragment and Related Logics." In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2021. http://dx.doi.org/10.1109/lics52264.2021.9470734.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Finite model theory"

1

Baader, Franz, and Felix Distel. A finite basis for the set of EL-implications holding in a finite model. Technische Universität Dresden, 2007. http://dx.doi.org/10.25368/2022.160.

Full text
Abstract:
Formal Concept Analysis (FCA) can be used to analyze data given in the form of a formal context. In particular, FCA provides efficient algorithms for computing a minimal basis of the implications holding in the context. In this paper, we extend classical FCA by considering data that are represented by relational structures rather than formal contexts, and by replacing atomic attributes by complex formulae defined in some logic. After generalizing some of the FCA theory to this more general form of contexts, we instantiate the general framework with attributes defined in the Description Logic (DL) EL, and with relational structures over a signature of unary and binary predicates, i.e., models for EL. In this setting, an implication corresponds to a so-called general concept inclusion axiom (GCI) in EL. The main technical result of this report is that, in EL, for any finite model there is a finite set of implications (GCIs) holding in this model from which all implications (GCIs) holding in the model follow.
APA, Harvard, Vancouver, ISO, and other styles
2

MacKinnon, R. J., T. M. Sullivan, S. A. Simonson, and C. J. Suen. BLT-EC (Breach, Leach Transport, and Equilibrium Chemistry), a finite-element model for assessing the release of radionuclides from low-level waste disposal units: Background, theory, and model description. Office of Scientific and Technical Information (OSTI), August 1995. http://dx.doi.org/10.2172/108216.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kotelnikov, I. A., and H. L. Berk. Finite Larmor radius flute mode theory with end loss. Office of Scientific and Technical Information (OSTI), August 1993. http://dx.doi.org/10.2172/10184780.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Ravazdezh, Faezeh, Julio A. Ramirez, and Ghadir Haikal. Improved Live Load Distribution Factors for Use in Load Rating of Older Slab and T-Beam Reinforced Concrete Bridges. Purdue University, 2021. http://dx.doi.org/10.5703/1288284317303.

Full text
Abstract:
This report describes a methodology for demand estimate through the improvement of load distribution factors in reinforced concrete flat-slab and T-beam bridges. The proposed distribution factors are supported on three-dimensional (3D) Finite Element (FE) analysis tools. The Conventional Load Rating (CLR) method currently in use by INDOT relies on a two-dimensional (2D) analysis based on beam theory. This approach may overestimate bridge demand as the result of neglecting the presence of parapets and sidewalks present in these bridges. The 3D behavior of a bridge and its response could be better modeled through a 3D computational model by including the participation of all elements. This research aims to investigate the potential effect of railings, parapets, sidewalks, and end-diaphragms on demand evaluation for purposes of rating reinforced concrete flat-slab and T-beam bridges using 3D finite element analysis. The project goal is to improve the current lateral load distribution factor by addressing the limitations resulting from the 2D analysis and ignoring the contribution of non-structural components. Through a parametric study of the slab and T-beam bridges in Indiana, the impact of selected parameters on demand estimates was estimated, and modifications to the current load distribution factors in AASHTO were proposed.
APA, Harvard, Vancouver, ISO, and other styles
5

Larmat, Carene, Monica Maceira, Robert W. Porritt, David Mitchell Higdon, Charlotte Anne Rowe, and Richard M. Allen. Validation of Western North America Models based on finite-frequency and ray theory imaging methods. Office of Scientific and Technical Information (OSTI), February 2015. http://dx.doi.org/10.2172/1169158.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Terzic, Vesna, and William Pasco. Novel Method for Probabilistic Evaluation of the Post-Earthquake Functionality of a Bridge. Mineta Transportation Institute, April 2021. http://dx.doi.org/10.31979/mti.2021.1916.

Full text
Abstract:
While modern overpass bridges are safe against collapse, their functionality will likely be compromised in case of design-level or beyond design-level earthquake, which may generate excessive residual displacements of the bridge deck. Presently, there is no validated, quantitative approach for estimating the operational level of the bridge after an earthquake due to the difficulty of accurately simulating residual displacements. This research develops a novel method for probabilistic evaluation of the post-earthquake functionality state of the bridge; the approach is founded on an explicit evaluation of bridge residual displacements and associated traffic capacity by considering realistic traffic load scenarios. This research proposes a high-fidelity finite-element model for bridge columns, developed and calibrated using existing experimental data from the shake table tests of a full-scale bridge column. This finite-element model of the bridge column is further expanded to enable evaluation of the axial load-carrying capacity of damaged columns, which is critical for an accurate evaluation of the traffic capacity of the bridge. Existing experimental data from the crushing tests on the columns with earthquake-induced damage support this phase of the finite-element model development. To properly evaluate the bridge's post-earthquake functionality state, realistic traffic loadings representative of different bridge conditions (e.g., immediate access, emergency traffic only, closed) are applied in the proposed model following an earthquake simulation. The traffic loadings in the finite-element model consider the distribution of the vehicles on the bridge causing the largest forces in the bridge columns.
APA, Harvard, Vancouver, ISO, and other styles
7

Riveros, Guillermo, Felipe Acosta, Reena Patel, and Wayne Hodo. Computational mechanics of the paddlefish rostrum. Engineer Research and Development Center (U.S.), September 2021. http://dx.doi.org/10.21079/11681/41860.

Full text
Abstract:
Purpose – The rostrum of a paddlefish provides hydrodynamic stability during feeding process in addition to detect the food using receptors that are randomly distributed in the rostrum. The exterior tissue of the rostrum covers the cartilage that surrounds the bones forming interlocking star shaped bones. Design/methodology/approach – The aim of this work is to assess the mechanical behavior of four finite element models varying the type of formulation as follows: linear-reduced integration, linear-full integration, quadratic-reduced integration and quadratic-full integration. Also presented is the load transfer mechanisms of the bone structure of the rostrum. Findings – Conclusions are based on comparison among the four models. There is no significant difference between integration orders for similar type of elements. Quadratic-reduced integration formulation resulted in lower structural stiffness compared with linear formulation as seen by higher displacements and stresses than using linearly formulated elements. It is concluded that second-order elements with reduced integration and can model accurately stress concentrations and distributions without over stiffening their general response. Originality/value – The use of advanced computational mechanics techniques to analyze the complex geometry and components of the paddlefish rostrum provides a viable avenue to gain fundamental understanding of the proper finite element formulation needed to successfully obtain the system behavior and hot spot locations.
APA, Harvard, Vancouver, ISO, and other styles
8

Campbell, R. L. Fluid Film Bearing Dynamic Coefficients and Their Application to Structural Finite Element Models. Fort Belvoir, VA: Defense Technical Information Center, August 2003. http://dx.doi.org/10.21236/ada465781.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Lu Wang and T.S. Hahm. Theory of Fine-scale Zonal Flow Generation From Trapped Electron Mode Turbulence. Office of Scientific and Technical Information (OSTI), June 2009. http://dx.doi.org/10.2172/958407.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Oliynyk, Kateryna, and Matteo Ciantia. Application of a finite deformation multiplicative plasticity model with non-local hardening to the simulation of CPTu tests in a structured soil. University of Dundee, December 2021. http://dx.doi.org/10.20933/100001230.

Full text
Abstract:
In this paper an isotropic hardening elastoplastic constitutive model for structured soils is applied to the simulation of a standard CPTu test in a saturated soft structured clay. To allow for the extreme deformations experienced by the soil during the penetration process, the model is formulated in a fully geometric non-linear setting, based on: i) the multiplicative decomposition of the deformation gradient into an elastic and a plastic part; and, ii) on the existence of a free energy function to define the elastic behaviour of the soil. The model is equipped with two bonding-related internal variables which provide a macroscopic description of the effects of clay structure. Suitable hardening laws are employed to describe the structure degradation associated to plastic deformations. The strain-softening associated to bond degradation usually leads to strain localization and consequent formation of shear bands, whose thickness is dependent on the characteristics of the microstructure (e.g, the average grain size). Standard local constitutive models are incapable of correctly capturing this phenomenon due to the lack of an internal length scale. To overcome this limitation, the model is framed using a non-local approach by adopting volume averaged values for the internal state variables. The size of the neighbourhood over which the averaging is performed (characteristic length) is a material constant related to the microstructure which controls the shear band thickness. This extension of the model has proven effective in regularizing the pathological mesh dependence of classical finite element solutions in the post-localization regime. The results of numerical simulations, conducted for different soil permeabilities and bond strengths, show that the model captures the development of plastic deformations induced by the advancement of the cone tip; the destructuration of the clay associated with such plastic deformations; the space and time evolution of pore water pressure as the cone tip advances. The possibility of modelling the CPTu tests in a rational and computationally efficient way opens a promising new perspective for their interpretation in geotechnical site investigations.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Finite model theory' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography