Filters








316 Hits in 6.9 sec

Page 5394 of Mathematical Reviews Vol. , Issue 94i [page]

1994 Mathematical Reviews  
{For the entire collection see MR 94f:03003.} 94i:68255 68T15 03B35 03C05 08A70 Ringeissen, Christophe Unification in a combination of equational theories with shared constants and its application to primal  ...  Summary: “We extend the results on combination of disjoint equational theories to combination of equational theories where the only function symbols shared are constants.  ... 

Symbolic Methods in Computational Cryptography Proofs

Gilles Barthe, Benjamin Gregoire, Charlie Jacomme, Steve Kremer, Pierre-Yves Strub
2019 2019 IEEE 32nd Computer Security Foundations Symposium (CSF)  
A partial implementation of our approach is integrated in EASYCRYPT, a proof assistant for provable security, and in MASKVERIF, a fully automated prover for masked implementations.  ...  In this paper, we develop principled methods for proving such elementary steps for probabilistic programs that operate over finite fields and related algebraic structures.  ...  We wish to thank the anonymous reviewers for their useful comments.  ... 
doi:10.1109/csf.2019.00017 dblp:conf/csfw/BartheGJKS19 fatcat:bdp72veonjdvbksf32gbqwqmxu

Boolean unification — The story so far

Urusula Martin, Tobias Nipkow
1989 Journal of symbolic computation  
In order to solve these two problems section invokes a bit of structure theory of Boolean algebras.  ...  It turns out that both unification methods have the same complexity which is exponential in the number of constants and variables.  ...  ) the general problem of combining boolean unification with unification algorithms for other disjoint theories is solved.  ... 
doi:10.1016/s0747-7171(89)80013-6 fatcat:dujedfdxbza77c73m3ydgeahoq

Page 1630 of Mathematical Reviews Vol. , Issue 94c [page]

1994 Mathematical Reviews  
Suttner, Parallel computation of multiple sets-of-support (238-249); Christophe Ringeissen, Unification in a combination of equational theories with shared constants and its application to primal algebras  ...  {The papers of mathematical interest that appear to be in final form are being reviewed individually. } 68 COMPUTER SCIENCE 94c:68003 68-06 ¥* Logic and algebra of specification.  ... 

Projectivity in (bounded) integral residuated lattices [article]

Paolo Aglianò, Sara Ugolini
2022 arXiv   pre-print
Finally, we connect our results with the theory of Unification.  ...  Its interaction with divisibility makes our results have a better scope in varieties of divisibile commutative integral residuated lattices, and it allows us to show that many such varieties have the property  ...  Algebraic unification theory: an application The origin of unification theory is usually attributed to Julia Robinson [50] .  ... 
arXiv:2008.13181v3 fatcat:4x3xqwx5w5glpjfc32tjm2vl2q

Goal-oriented a posteriori error estimation for conforming and nonconforming approximations with inexact solvers

Gouranga Mallik, Martin Vohralík, Soleiman Yousef
2019 Journal of Computational and Applied Mathematics  
They show excellent effectivity indices even in presence of primal and dual algebraic errors and enable to spare a large percentage of unnecessary algebraic iterations.  ...  The considered problem is a model linear second-order elliptic equation with inhomogeneous Dirichlet and Neumann boundary conditions and the quantity of interest is given by an arbitrary functional composed  ...  It can be observed from Figure 3 that for both the primal and the dual problems, the discretization estimators remain constant after 10 or 15 iterations of the algebraic solver.  ... 
doi:10.1016/j.cam.2019.112367 fatcat:pt3lm3e4unbctbnn4rov4izdry

Automation of Higher-Order Logic [chapter]

Christoph Benzmüller, Dale Miller
2014 Handbook of the History of Logic  
We thank Chad Brown for sharing notes that he has written related to the material in this chapter.  ...  Besides the readers of this chapter, we thank Zakaria Chihani, Julian Röder, Leon Weber, and Max Wisnieswki for proofreading the document.  ...  Instead of sets, one could also explore the use of algebra and universal properties to develop a categorical theory of mathematics.  ... 
doi:10.1016/b978-0-444-51624-4.50005-8 fatcat:jfcztdvymjfujg3bzb2rq2qyzy

New Developments for Increased Performance of the SBP-SAT Finite Difference Technique [chapter]

J. Nordström, P. Eliasson
2015 Notes on Numerical Fluid Mechanics and Multidisciplinary Design  
In particular we discuss the use of weak boundary conditions and dual consistent formulations.  ...  The use of weak boundary conditions focus on increased convergence to steady state, and hence efficiency. Dual consistent schemes produces superconvergent functionals and increases accuracy.  ...  An interesting property is that the primal equations (39) with the primal boundary conditions (40), and the dual equations (46) with the dual boundary conditions (47), share the same energy estimate.  ... 
doi:10.1007/978-3-319-12886-3_22 fatcat:edrh4lkrdffgblffub5gyatcni

Integration of topological modification within the modeling of multi-physics systems: Application to a Pogo-stick

Nourhene Abdeljabbar Kharrat, Régis Plateaux, Mariem Miladi Chaabane, Jean-Yves Choley, Chafik Karra, Mohamed Haddar
2018 Comptes rendus. Mecanique  
In order to validate this methodology, the case of Pogo-stick is studied. The first step consists in generating a topological graph of the system.  ...  The present work tackles the modeling of multi-physics systems applying a topological approach while proceeding with a new methodology using a topological modification to the structure of systems.  ...  Acknowledgements The present research work has been supported by (a) QUARTZ Laboratory, the High Institute of Mechanic of Paris (SUP-MECA) and by (b) the Laboratory of Mechanics, Modeling and Manufacturing  ... 
doi:10.1016/j.crme.2018.01.004 fatcat:3f5pvdunkjdwpf6gvly6xabyea

Cumulative index volumes 1–200

1999 Theoretical Computer Science  
A parsing automata approach to LR theory 15 (2) (1981) 117-157 Heilbrunner, S., A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages 23  ...  Hankin 56 (1) (1988) 17-36 and closure operations 78 (2) (1991) 377-381 Burroni, A., Higher-dimensional word problems with applications to equational logic I IS (1) (1993) 43-67 Burstall, R.M.,  ... 
doi:10.1016/s0304-3975(98)00321-1 fatcat:5wscxtd3qfdyrcvnx3dvavfb6i

The book review column

William Gasarch
2006 ACM SIGACT News  
In this column we review the following books.  ...  A student with a background in any two of predicate logic, automata theory, and modern algebra should find the book pleasant reading.  ...  Much is made in both the forewords (by Hoare, Milner, and Bergstra) and the preface of the unification of the various systems in the present book; the preface even claims that it is a successor to the  ... 
doi:10.1145/1140612.1140614 fatcat:csh47xvp4jaapcebrtahj3u3jm

An ideal model for recursive polymorphic types

David MacQueen, Gordon Plotkin, Ravi Sethi
1984 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84  
The basic theory of domains and the solution of such domain equations is summarized in Section 2.  ...  Now we turn to our constructions with the aim of showing V to be co-primal. First, every flat cpo is co-primal as all its elements, except ±, are primes. Let D and E be co-primal domains.  ...  Below, d, x:a is the assignment identical to ~, except that it assigns a to x, Below, "t is not free in d" means that t is not free in any type assigned by d, and a[~/t] is the result of substituting for  ... 
doi:10.1145/800017.800528 dblp:conf/popl/MacQueenPS84 fatcat:6selwazzwnbvll3cr5n5e34gbq

An ideal model for recursive polymorphic types

David MacQueen, Gordon Plotkin, Ravi Sethi
1986 Information and Control  
The basic theory of domains and the solution of such domain equations is summarized in Section 2.  ...  Now we turn to our constructions with the aim of showing V to be co-primal. First, every flat cpo is co-primal as all its elements, except ±, are primes. Let D and E be co-primal domains.  ...  Below, d, x:a is the assignment identical to ~, except that it assigns a to x, Below, "t is not free in d" means that t is not free in any type assigned by d, and a[~/t] is the result of substituting for  ... 
doi:10.1016/s0019-9958(86)80019-5 fatcat:jywkm2bm6jehllzmfkrm6srfga

A Formal Proof of the Irrationality of ζ(3) [article]

Assia Mahboubi, Thomas Sibut-Pinote
2021 arXiv   pre-print
We formally prove this result by an a posteriori verification of calculations performed by computer algebra algorithms in a Maple session.  ...  The crux of this proof is to establish that some sequences satisfy a common recurrence.  ...  We also thank Cyril Cohen, Pierre Roux and Enrico Tassi for their help, in particular with the libraries this work depends on.  ... 
arXiv:1912.06611v6 fatcat:kijni3uvvjcpjhvm4esnq3bcgy

Yuri, Logic, and Computer Science [chapter]

Andreas Blass, Nachum Dershowitz, Wolfgang Reisig
2010 Lecture Notes in Computer Science  
Here we investigate infon logic and a narrow but useful primal fragment of it.  ...  Roughly speaking, a background class assigns to each set (of atoms) a structure (for example, of sets or arrays or combinations of these and similar entities), and it assigns to each embedding of one set  ... 
doi:10.1007/978-3-642-15025-8_1 fatcat:ehjpkiqxzbh55k7waxqwzfhw6y
« Previous Showing results 1 — 15 out of 316 results