Certifying Proofs in the First-Order Theory of Rewriting

Mapping Intimacies ◽

10.26226/morressier.604907f41a80aac83ca25cd6 ◽

2021 ◽

Author(s):

Fabian Mitterwallner

Keyword(s):

Order Theory ◽

First Order ◽

First Order Theory

Download Full-text

First-order-theory-based thermoelastic stability of functionally graded material circular plates

AIAA Journal ◽

10.2514/3.15214 ◽

2002 ◽

Vol 40 ◽

pp. 1444-1450 ◽

Author(s):

M. Najafizadeh ◽

M. R. Eslami

Keyword(s):

Functionally Graded Material ◽

Order Theory ◽

Functionally Graded ◽

Circular Plates ◽

First Order ◽

First Order Theory ◽

Graded Material

Download Full-text

On equations and first-order theory of one-relator monoids

Information and Computation ◽

10.1016/j.ic.2021.104745 ◽

2021 ◽

pp. 104745

Author(s):

Albert Garreta ◽

Robert D. Gray

Keyword(s):

Order Theory ◽

First Order ◽

First Order Theory

Download Full-text

A verified decision procedure for the first-order theory of rewriting for linear variable-separated rewrite systems

Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs ◽

10.1145/3437992.3439918 ◽

2021 ◽

Author(s):

Alexander Lochmann ◽

Aart Middeldorp ◽

Fabian Mitterwallner ◽

Bertram Felgenhauer

Keyword(s):

Decision Procedure ◽

Order Theory ◽

Rewrite Systems ◽

First Order ◽

First Order Theory

Download Full-text

A first-order theory of Ulm type

Computability ◽

10.3233/com-180099 ◽

2019 ◽

Vol 8 (3-4) ◽

pp. 347-358

Author(s):

Matthew Harrison-Trainor

Keyword(s):

Order Theory ◽

First Order ◽

First Order Theory

Download Full-text

Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers

Journal of Automated Reasoning ◽

10.1007/s10817-015-9351-3 ◽

2015 ◽

Vol 57 (2) ◽

pp. 157-185 ◽

Author(s):

Peter Franek ◽

Stefan Ratschan ◽

Piotr Zgliczynski

Keyword(s):

Order Theory ◽

Real Numbers ◽

First Order ◽

First Order Theory

Download Full-text

Stability, the f.c.p., and superstability; model theoretic properties of formulas in first order theory

Annals of Mathematical Logic ◽

10.1016/0003-4843(71)90015-5 ◽

1971 ◽

Vol 3 (3) ◽

pp. 271-362 ◽

Author(s):

Saharon Shelah

Keyword(s):

Order Theory ◽

First Order ◽

First Order Theory

Download Full-text

A reciprocal theorem for a first order theory of electrostriction

Zeitschrift für angewandte Mathematik und Physik ◽

10.1007/bf01589267 ◽

1963 ◽

Vol 14 (2) ◽

pp. 148-155 ◽

Author(s):

Robin J. Knops

Keyword(s):

Order Theory ◽

Reciprocal Theorem ◽

First Order ◽

First Order Theory

Download Full-text

The spectrum of resplendency

Journal of Symbolic Logic ◽

10.2307/2274652 ◽

1990 ◽

Vol 55 (2) ◽

pp. 626-636

Author(s):

John T. Baldwin

Keyword(s):

Homogeneous Model ◽

Order Theory ◽

First Order ◽

First Order Theory ◽

Uncountable Cardinal ◽

Recursive Theory ◽

Finite Language

AbstractLet T be a complete countable first order theory and λ an uncountable cardinal. Theorem 1. If T is not superstable, T has 2λ resplendent models of power λ. Theorem 2. If T is strictly superstable, then T has at least min(2λ, ℶ2) resplendent models of power λ. Theorem 3. If T is not superstable or is small and strictly superstable, then every resplendent homogeneous model of T is saturated. Theorem 4 (with Knight). For each μ ∈ ω ∪ {ω, 2ω} there is a recursive theory in a finite language which has μ resplendent models of power κ for every infinite κ.

Download Full-text

First Order Theory of Perturbed Circular Motion: An Application to Artificial Satellites

Predictability, Stability, and Chaos in N-Body Dynamical Systems - NATO ASI Series ◽

10.1007/978-1-4684-5997-5_24 ◽

1991 ◽

pp. 291-295

Author(s):

E. Bois ◽

I. Wytrzyszczak

Keyword(s):

Order Theory ◽

Circular Motion ◽

Artificial Satellites ◽

First Order ◽

First Order Theory

Download Full-text

Model Theory of Epimorphisms

Canadian Mathematical Bulletin ◽

10.4153/cmb-1974-083-6 ◽

1974 ◽

Vol 17 (4) ◽

pp. 471-477 ◽

Author(s):

Paul D. Bacsich

Keyword(s):

Model Theory ◽

Order Theory ◽

First Order ◽

First Order Theory

Given a first-order theory T, welet be the category of models of T and homomorphisms between them. We shall show that a morphism A→B of is an epimorphism if and only if every element of B is definable from elements of A in a certain precise manner (see Theorem 1), and from this derive the best possible Cowell- power Theorem for .

Download Full-text