ct.\*:(%22Logic and foundations%22)
Results 1 to 25 of 22737
Selection :
Towards a descriptive set theory for domain-like structuresSELIVANOV, Victor L.Theoretical computer science. 2006, Vol 365, Num 3, pp 258-282, issn 0304-3975, 25 p.Conference Paper
Completeness of temporal logics over infinite intervalsHANPIN WANG; QIWEN XU.Discrete applied mathematics. 2004, Vol 136, Num 1, pp 87-103, issn 0166-218X, 17 p.Article
Towards an algebraic theory of typed mobile processesYUXIN DENG; SANGIORGI, Davide.Theoretical computer science. 2006, Vol 350, Num 2-3, pp 188-212, issn 0304-3975, 25 p.Conference Paper
Working with ARMs: complexity results on atomic representations of Herbrand modelsGOTTLOB, Georg; PICHLER, Reinhard.Information and computation (Print). 2001, Vol 165, Num 2, pp 183-207, issn 0890-5401Article
Connection methods in linear logic and proof nets constructionGALMICHE, D.Theoretical computer science. 2000, Vol 232, Num 1-2, pp 231-272, issn 0304-3975Article
From fuzzy logic to fuzzy mathematics : A methodological manifestoBEHOUNEK, Libor; CINTULA, Petr.Fuzzy sets and systems. 2006, Vol 157, Num 5, pp 642-646, issn 0165-0114, 5 p.Article
Reasoning with power defaultsZHANG, Guo-Qiang; ROUNDS, William C.Theoretical computer science. 2004, Vol 323, Num 1-3, pp 321-350, issn 0304-3975, 30 p.Article
Consequences of an exotic definition for P = NPDA COSTA, N. C. A; DORIA, F. A.Applied mathematics and computation. 2003, Vol 145, Num 2-3, pp 655-665, issn 0096-3003, 11 p.Article
Interaction nets for linear logicMACKIE, Ian.Theoretical computer science. 2000, Vol 247, Num 1-2, pp 83-140, issn 0304-3975Article
A note on implicators based on binary aggregation operators in interval-valued fuzzy set theoryLIU, Hua-Wen; WANG, Guo-Jun.Fuzzy sets and systems. 2006, Vol 157, Num 24, pp 3231-3236, issn 0165-0114, 6 p.Article
Basic intuitionistic principles in fuzzy set theories and its extensions (A terminological debate on Atanassov IFS)CATTANEO, Gianpiero; CIUCCI, Davide.Fuzzy sets and systems. 2006, Vol 157, Num 24, pp 3198-3219, issn 0165-0114, 22 p.Article
Nominal logic, a first order theory of names and bindingPITTS, Andrew M.Information and computation (Print). 2003, Vol 186, Num 2, pp 165-193, issn 0890-5401, 29 p.Conference Paper
Proof finding algorithms for implicational logicsBUNDER, M. W.Theoretical computer science. 2000, Vol 232, Num 1-2, pp 165-186, issn 0304-3975Article
Complexity of categorical theories with computable modelsGONCHAROV, S. S. S; KHUSAINOV, B. Kh.Doklady. Mathematics. 2002, Vol 66, Num 1, pp 52-54, issn 1064-5624Article
Cercles vicieux, mathématiques et formalisations logiques = Vicious circles, mathematics and logicLONGO, Giuseppe.Mathématiques et sciences humaines (2000). 2000, Num 152, pp 5-26, issn 0987-6936Article
Logique et fondements des mathématiquesGauthier, Yvon.Concepts. 1997, isbn 2-84134-040-6, II, 174 p, isbn 2-84134-040-6Book
Invariants, boolean algebras and ACA+0SHORE, Richard A.Transactions of the American Mathematical Society. 2006, Vol 358, Num 3, pp 989-1014, issn 0002-9947, 26 p.Article
Computable trees, prime models, and relative decidabilityHIRSCHFELDT, Denis R.Proceedings of the American Mathematical Society. 2006, Vol 134, Num 5, pp 1495-1498, issn 0002-9939, 4 p.Article
Disjunctive elimination rule and its application in MTLWANG, San-Min; WANG, Ming-Yan.Fuzzy sets and systems. 2006, Vol 157, Num 24, pp 3169-3176, issn 0165-0114, 8 p.Article
Subcategories of lattice-valued convergence spacesJÄGER, Gunther.Fuzzy sets and systems. 2005, Vol 156, Num 1, pp 1-24, issn 0165-0114, 24 p.Article
Polarized proof-nets and λμ-calculusLAURENT, Olivier.Theoretical computer science. 2003, Vol 290, Num 1, pp 161-188, issn 0304-3975, 28 p.Article
MELL in the calculus of structuresSTRASSBURGER, Lutz.Theoretical computer science. 2003, Vol 309, Num 1-3, pp 213-285, issn 0304-3975, 73 p.Article
Automated theorem proving by resolution in non-classical logicsSOFRONIE-STOKKERMANS, Viorica.Knowledge discovery and discrete mathematics. International conferenceJIM'2003 : journées de l'informatique messine. 2003, pp 151-167, isbn 2-7261-1256-0, 17 p.Conference Paper
Tractability of Cut-free Gentzen-type propositional calculus with permutation inference IIARAI, N. H.Theoretical computer science. 2000, Vol 243, Num 1-2, pp 185-197, issn 0304-3975Article
The symmetry rule in propositional logic : The Satisfiability ProblemURQUHART, A.Discrete applied mathematics. 1999, Vol 96-97, pp 177-193, issn 0166-218XArticle