• Daneshyari
  • Topics
    • Physical Sciences and Engineering
      Life Sciences
      Health Sciences
      Social Sciences and Humanities
Daneshyari Logic Journas Latest Articles

Logic Research Articles

Supporting the formal verification of mathematical texts
Fulltext Access 30 Pages 2006
The three dimensions of proofs
Fulltext Access 30 Pages 2006
Cardinal invariants of the continuum and combinatorics on uncountable cardinals
Fulltext Access 30 Pages 2006
Periodicity based decidable classes in a first order timed logic
Fulltext Access 31 Pages 2006
More on Wadge determinacy
Fulltext Access 31 Pages 2006
SAD as a mathematical assistant—how should we go from here to there?
Fulltext Access 32 Pages 2006
Pretopologies and a uniform presentation of sup-lattices, quantales and frames
Fulltext Access 32 Pages 2006
Interpolation and Beth’s property in propositional many-valued logics: A semantic investigation
Fulltext Access 32 Pages 2006
Complexity of monodic guarded fragments over linear and real time
Fulltext Access 32 Pages 2006
Non-commutative proof construction: A constraint-based approach
Fulltext Access 33 Pages 2006
Theorema: Towards computer-aided mathematical theory exploration
Fulltext Access 35 Pages 2006
Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert
Fulltext Access 35 Pages 2006
The monadic second-order logic of graphs XV: On a conjecture by D. Seese
Fulltext Access 36 Pages 2006
Independence in finitary abstract elementary classes
Fulltext Access 36 Pages 2006
Parameterized counting problems
Fulltext Access 36 Pages 2006
Profinite structures interpretable in fields
Fulltext Access 36 Pages 2006
Succinct definitions in the first order theory of graphs
Fulltext Access 36 Pages 2006
Four and more
Fulltext Access 37 Pages 2006
Elementary canonical formulae: extending Sahlqvist’s theorem
Fulltext Access 38 Pages 2006
Categoricity in abstract elementary classes with no maximal models
Fulltext Access 40 Pages 2006
A globalisation of the Gelfand duality theorem
Fulltext Access 42 Pages 2006
Innovations in computational type theory using Nuprl
Fulltext Access 42 Pages 2006
Equivalence between Fraïssé’s conjecture and Jullien’s theorem
Fulltext Access 42 Pages 2006
Formal Zariski topology: Positivity and points
Fulltext Access 43 Pages 2006
Fundamental notions of analysis in subsystems of second-order arithmetic
Fulltext Access 47 Pages 2006
Iterated pushdown automata and sequences of rational numbers
Fulltext Access 49 Pages 2006
Imaginaries in real closed valued fields
Fulltext Access 50 Pages 2006
Programming interfaces and basic topology
Fulltext Access 51 Pages 2006
The cardinals below |[ω1]<ω1|
Fulltext Access 72 Pages 2006
The spectrum of elementary embeddings j:V→Vj:V→V
Fulltext Access 73 Pages 2006
Computing interpolants in implicational logics
Fulltext Access 77 Pages 2006
Editorial Board
Fulltext Access 4 Pages 2005
WoLLIC'2002
Fulltext Access 4 Pages 2005
A Paraconsistent Decagon
Fulltext Access 5 Pages 2005
Paraconsistent logic from a modal viewpoint
Fulltext Access 8 Pages 2005
Controlling witnesses
Fulltext Access 8 Pages 2005
On sparseness, reducibilities, and complexity
Fulltext Access 9 Pages 2005
Undefinability results in o-minimal expansions of the real numbers
Fulltext Access 9 Pages 2005
Finite information logic
Fulltext Access 11 Pages 2005
A descending chain condition for groups definable in o-minimal structures
Fulltext Access 11 Pages 2005
Dependence relations in computably rigid computable vector spaces
Fulltext Access 12 Pages 2005
Aristotle's Thesis between paraconsistency and modalization
Fulltext Access 13 Pages 2005
κ-bounded exponential-logarithmic power series fields
Fulltext Access 13 Pages 2005
Stability in geometric theories
Fulltext Access 14 Pages 2005
Inductive definitions over a predicative arithmetic
Fulltext Access 14 Pages 2005
Completeness of S4 with respect to the real line: revisited
Fulltext Access 15 Pages 2005
A proof of topological completeness for S4 in (0, 1)
Fulltext Access 15 Pages 2005
Upper and lower Ramsey bounds in bounded arithmetic
Fulltext Access 16 Pages 2005
Equivalents of the (Weak) Fan Theorem
Fulltext Access 16 Pages 2005
A term calculus for (co-)recursive definitions on streamlike data structures
Fulltext Access 16 Pages 2005
First-order definitions of rational functions and S-integers over holomorphy rings of algebraic functions of characteristic 0
Fulltext Access 17 Pages 2005
Some results on extensionality in lambda calculus
Fulltext Access 17 Pages 2005
Independence results around constructive ZF
Fulltext Access 17 Pages 2005
Geometric axioms for existentially closed Hasse fields
Fulltext Access 17 Pages 2005
The minimal e-degree problem in fragments of Peano arithmetic
Fulltext Access 17 Pages 2005
Elementary arithmetic
Fulltext Access 18 Pages 2005
Reflections on reflections in explicit mathematics
Fulltext Access 18 Pages 2005
Rule-based schema matching for ontology-based mediators
Fulltext Access 18 Pages 2005
Explicit mathematics: power types and overloading
Fulltext Access 19 Pages 2005
On the limit existence principles in elementary arithmetic and Σn0-consequences of theories
Fulltext Access 19 Pages 2005
Free abelian lattice-ordered groups
Fulltext Access 19 Pages 2005
Ideas in the epsilon substitution method for Π10-FIX
Fulltext Access 19 Pages 2005
Replacement versus collection and related topics in constructive Zermelo-Fraenkel set theory
Fulltext Access 19 Pages 2005
Constructive completions of ordered sets, groups and fields
Fulltext Access 20 Pages 2005
Automated search for Gödel's proofs
Fulltext Access 20 Pages 2005
Safe beliefs for propositional theories
Fulltext Access 20 Pages 2005
Structures interpretable in models of bounded arithmetic
Fulltext Access 20 Pages 2005
A Banach-Mazur computable but not Markov computable function on the computable real numbers
Fulltext Access 20 Pages 2005
A comprehensive semantic framework for data integration systems
Fulltext Access 21 Pages 2005
The elementary theory of Dedekind cuts in polynomially bounded structures
Fulltext Access 22 Pages 2005
Paraconsistent Informational Logic
Fulltext Access 22 Pages 2005
A simple proof of second-order strong normalization with permutative conversions
Fulltext Access 22 Pages 2005
On the structure of paraconsistent extensions of Johansson's logic
Fulltext Access 23 Pages 2005
Abstract State Machines: a unifying view of models of computation and of system design frameworks
Fulltext Access 23 Pages 2005
Zero, successor and equality in BDDs
Fulltext Access 23 Pages 2005
A logic for deontic dilemmas
Fulltext Access 23 Pages 2005
Lattice-ordered reduced special groups
Fulltext Access 23 Pages 2005
Alternating automata and temporal logic normal forms
Fulltext Access 23 Pages 2005
Weak elimination of imaginaries for Boolean algebras
Fulltext Access 24 Pages 2005
Logical aspects of Cayley-graphs: the group case
Fulltext Access 24 Pages 2005
Anti-intuitionism and paraconsistency
Fulltext Access 24 Pages 2005
Uniform Heyting arithmetic
Fulltext Access 24 Pages 2005
Remarks on applicative theories
Fulltext Access 25 Pages 2005
The logic of proofs, semantically
Fulltext Access 25 Pages 2005
On obligations and normative ability: Towards a logical analysis of the social contract
Fulltext Access 25 Pages 2005
Obligation, contracts, and negotiation: Outlining an approach
Fulltext Access 25 Pages 2005
Axioms for strict and lazy functional programs
Fulltext Access 26 Pages 2005
Dynamic topological logic
Fulltext Access 26 Pages 2005
Separation results for the size of constant-depth propositional proofs
Fulltext Access 26 Pages 2005
Non-strictly positive fixed points for classical natural deduction
Fulltext Access 26 Pages 2005
About cut elimination for logics of common knowledge
Fulltext Access 27 Pages 2005
Completely mitotic c.e. degrees and non-jump inversion
Fulltext Access 27 Pages 2005
Inductive types and exact completion
Fulltext Access 27 Pages 2005
Control structures in programs and computational complexity
Fulltext Access 27 Pages 2005
Models for a paraconsistent set theory
Fulltext Access 27 Pages 2005
Combining classical logic, paraconsistency and relevance
Fulltext Access 28 Pages 2005
Conflicting imperatives and dyadic deontic logic
Fulltext Access 28 Pages 2005
Enumerations in computable structure theory
Fulltext Access 28 Pages 2005
Pseudo-exponentiation on algebraically closed fields of characteristic zero
Fulltext Access 29 Pages 2005
Faith & falsity
Fulltext Access 29 Pages 2005
<< < 12 13 14 15 16 > >>
Related Topics
Fuzzy logic Articles
2743 Papers
Game theory Articles
2003 Papers
Fuzzy sets Articles
1216 Papers
Algebra and Number Theory Articles
Analysis Articles
Applied Mathematics Articles
Computational Mathematics Articles
Control and Optimization Articles
Discrete Mathematics and Combinatorics Articles
Geometry and Topology Articles
Logic Articles
Mathematical Physics Articles
Mathematics (General) Articles
Modelling and Simulation Articles
Numerical Analysis Articles
Statistics and Probability Articles
Theoretical Computer Science Articles
All Topics
Related Journals
Algebra and Number Theory Journals
Analysis Journals
Applied Mathematics Journals
Computational Mathematics Journals
Control and Optimization Journals
Discrete Mathematics and Combinatorics Journals
Geometry and Topology Journals
Logic Journals
Mathematical Physics Journals
Mathematics (General) Journals
Modelling and Simulation Journals
Numerical Analysis Journals
Statistics and Probability Journals
Theoretical Computer Science Journals
Annals of Pure and Applied Logic Journal
Journal of Applied Logic Journal

Daneshyari.com

دسترسی سریع

  • صفحه اصلی دانشیاری
  • دسته بندی موضوعی مقالات
  • مقالات ترجمه شده
  • سفارش ترجمه مقاله
  • سفارش تولید محتوا
  • تولید محتوا

ارتباط

  • ورود
  • عضویت
  • تماس و پشتیبانی
  • تبلیغات

English Website

  • Home
  • Physical Sciences and Engineering
  • Life Sciences
  • Health Sciences
  • Social Sciences and Humanities