Jeffrey B. Remmel

Discret. Math. Theor. Comput. Sci., 2022

2020

Effective Categoricity of Automatic Equivalence and Nested Equivalence Structures.

[BibT_eX]

[DOI]

Jacob Carson

Theory Comput. Syst., 2020

On the complexity of index sets for finite predicate logic programs which allow function symbols.

[BibT_eX]

[DOI]

J. Log. Comput., 2020

Schur function expansions and the Rational Shuffle Theorem.

[BibT_eX]

[DOI]

Dun Qiu

J. Comb. Theory, Ser. A, 2020

2019

Classical pattern distributions in Sn(132) and Sn(123).

[BibT_eX]

[DOI]

Dun Qiu

Discret. Math. Theor. Comput. Sci., 2019

The combinatorial properties of the Benoumhani polynomials for the Whitney numbers of Dowling lattices.

[BibT_eX]

[DOI]

Sittipong Thamrongpairoj

Discret. Math., 2019

Counting consecutive pattern matches in Sn(132) and Sn(123).

[BibT_eX]

[DOI]

Ran Pan

Dun Qiu

Adv. Appl. Math., 2019

2018

On the Schur Positivity of Δe2 en[X].

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

An iterative algorithm to eliminate edges for traveling salesman problem based on a new binomial distribution - Eliminating edges for TSP.

[BibT_eX]

[DOI]

Yong Wang

Appl. Intell., 2018

A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals.

[BibT_eX]

[DOI]

Yong Wang

Proceedings of the Frontiers in Algorithmics - 12th International Workshop, 2018

2017

Rises in forests of binary shrubs.

[BibT_eX]

[DOI]

Sai-Nan Zheng

Discret. Math. Theor. Comput. Sci., 2017

Action Language Hybrid AL.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2017

Injection Structures Specified by Finite State Transducers.

[BibT_eX]

[DOI]

Proceedings of the Computability and Complexity, 2017

2016

A Binomial Distribution Model for the Traveling Salesman Problem Based on Frequency Quadrilaterals.

[BibT_eX]

[DOI]

Yong Wang

J. Graph Algorithms Appl., 2016

Bijections on m-level rook placements.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays.

[BibT_eX]

[DOI]

Ran Pan

Discret. Math. Theor. Comput. Sci., 2016

Descent c-Wilf Equivalence.

[BibT_eX]

[DOI]

Quang T. Bach

Discret. Math. Theor. Comput. Sci., 2016

Q-analogues of convolutions of Fibonacci numbers.

[BibT_eX]

[DOI]

Janine LoBue Tiefenbruck

Australas. J Comb., 2016

Generating functions for descents over permutations which avoid sets of consecutive patterns.

[BibT_eX]

[DOI]

Quang T. Bach

Australas. J Comb., 2016

Index Sets for Finite Normal Predicate Logic Programs with Function Symbols.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2016

2015

An extension of MacMahon's equidistribution theorem to ordered set partitions.

[BibT_eX]

[DOI]

Andrew Timothy Wilson

J. Comb. Theory, Ser. A, 2015

Quadrant Marked Mesh Patterns in 132-avoiding Permutations III.

[BibT_eX]

[DOI]

Mark Tiefenbruck

Integers, 2015

Quadrant Marked Mesh Patterns in 132-Avoiding Permutations II.

[BibT_eX]

[DOI]

Mark Tiefenbruck

Integers, 2015

Frame patterns in n-cycles.

[BibT_eX]

[DOI]

Miles Eli Jones

Discret. Math., 2015

(a, b)-rectangle patterns in permutations and words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Representing Graphs via Pattern Avoiding Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2015

Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2015

2014

The 1-Box Pattern on Pattern-Avoiding Permutations.

[BibT_eX]

[DOI]

J. Integer Seq., 2014

m-Level rook placements.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2014

Sub-computable Boundedness Randomness.

[BibT_eX]

[DOI]

Sam Buss

Log. Methods Comput. Sci., 2014

Consecutive Up-down Patterns in Up-down Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Hybrid Answer Set Programming.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2014

2013

Two-to-one structures.

[BibT_eX]

[DOI]

J. Log. Comput., 2013

A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern.

[BibT_eX]

[DOI]

Miles Eli Jones

Discret. Math., 2013

Index sets for Finite Normal Predicate Logic Programs

[BibT_eX]

[DOI]

CoRR, 2013

Sub-computable Bounded Pseudorandomness.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

Forward Chaining for Hybrid ASP.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2013

2012

Expressing Preferences using Preference Set Constraint Atoms

[BibT_eX]

[DOI]

CoRR, 2012

A connection between the Cantor-Bendixson derivative and the well-founded semantics of finite logic programs.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2012

Combining Logic, Continuous Parameters and Markov Decision Processes Using Hybrid ASP.

[BibT_eX]

[DOI]

Proceedings of the 2nd International Workshop on Statistical Relational AI (StaRAI-12), 2012

Disjunctive Programs with Set Constraints.

[BibT_eX]

[DOI]

Proceedings of the Correct Reasoning, 2012

2011

Guarded resolution for Answer Set Programming.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2011

Quasi-symmetric functions and up-down compositions.

[BibT_eX]

[DOI]

Evan Fuller

Discret. Math., 2011

Enumerating (2+2)-free posets by the number of minimal elements and other statistics.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Minimal Overlapping Patterns in Colored Permutations.

[BibT_eX]

[DOI]

Adrian Duane

Electron. J. Comb., 2011

Σ01 and Π01 equivalence structures.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2011

Hybrid ASP.

[BibT_eX]

[DOI]

Proceedings of the Technical Communications of the 27th International Conference on Logic Programming, 2011

Effective Categoricity of Injection Structures.

[BibT_eX]

[DOI]

Proceedings of the Models of Computation in Context, 2011

Effectively Reasoning about Infinite Sets in Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

2010

Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns.

[BibT_eX]

[DOI]

Integers, 2010

Generating Functions for Permutations which Contain a Given Descent Set.

[BibT_eX]

[DOI]

Manda Riehl

Electron. J. Comb., 2010

2009

K-Triviality of Closed Sets and Continuous Functions.

[BibT_eX]

[DOI]

J. Log. Comput., 2009

Equivalence structures and isomorphisms in the difference hierarchy.

[BibT_eX]

[DOI]

Geoffrey LaForte

J. Symb. Log., 2009

An Application of Proof-Theory in answer Set Programming

[BibT_eX]

[DOI]

CoRR, 2009

Rationality, Irrationality, and Wilf Equivalence in Generalized Factor Order.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

q-Counting Descent Pairs with Prescribed Tops and Bottoms.

[BibT_eX]

[DOI]

John T. Hall

Jeffrey Liese

Electron. J. Comb., 2009

The complexity of recursive constraint satisfaction problems.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2009

Space complexity of Abelian groups.

[BibT_eX]

[DOI]

Arch. Math. Log., 2009

Rook-by-rook rook theory: Bijective proofs of rook and hit equivalences.

[BibT_eX]

[DOI]

Nicholas A. Loehr

Adv. Appl. Math., 2009

Automata and Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

S01 and P01 Equivalence Structures.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Theory and Computational Practice, 2009

2008

Counting descent pairs with prescribed tops and bottoms.

[BibT_eX]

[DOI]

John T. Hall

J. Comb. Theory, Ser. A, 2008

Counting Descents, Rises, and Levels, with Prescribed First Element, in Words.

[BibT_eX]

[DOI]

Toufik Mansour

Discret. Math. Theor. Comput. Sci., 2008

Descents, inversions, and major indices in permutation groups.

[BibT_eX]

[DOI]

Anthony Mendes

Discret. Math., 2008

Augmented Rook Boards and General Product Formulas.

[BibT_eX]

[DOI]

Brian K. Miceli

Electron. J. Comb., 2008

The Combinatorics of the Garsia-Haiman Modules for Hook Shapes.

[BibT_eX]

[DOI]

Ron M. Adin

Yuval Roichman

Electron. J. Comb., 2008

Algorithmic randomness of continuous functions.

[BibT_eX]

[DOI]

Arch. Math. Log., 2008

My work with Victor Marek: a mathematician looks at answer set programming.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2008

Consistency properties and set based logic programming.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2008

Set based logic programming.

[BibT_eX]

[DOI]

Howard A. Blair

Ann. Math. Artif. Intell., 2008

The chase revisited.

[BibT_eX]

[DOI]

Alin Deutsch

Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2008

A Mathematician Looks at Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

A Connection between Cantor-Bendixson Derivatives and the Well-Founded Semantics of Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming, 24th International Conference, 2008

2007

Compactness Properties for Stable Semantics of Logic Programs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2007

K -Trivial Closed Sets and Continuous Functions.

[BibT_eX]

[DOI]

Proceedings of the Computation and Logic in the Real World, 2007

2006

On the complexity of inductive definitions.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2006

Complexity, decidability and completeness.

[BibT_eX]

[DOI]

J. Symb. Log., 2006

m-Rook numbers and a generalization of a formula of Frobenius to Cm Sn.

[BibT_eX]

[DOI]

Karen S. Briggs

J. Comb. Theory, Ser. A, 2006

Random Continuous Functions.

[BibT_eX]

[DOI]

Paul Brodhead

Proceedings of the Third International Conference on Computability and Complexity in Analysis, 2006

Infinitely-Often Universal Languages and Diagonalization.

[BibT_eX]

[DOI]

Russell Impagliazzo

Electron. Colloquium Comput. Complex., 2006

Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions.

[BibT_eX]

[DOI]

Andrius Kulikauskas

Electron. J. Comb., 2006

Classifying Descents According to Equivalence mod k.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Permutations and words counted by consecutive patterns.

[BibT_eX]

[DOI]

Anthony Mendes

Adv. Appl. Math., 2006

Enumeration of m-tuples of permutations and a new class of power bases for the space of symmetric functions.

[BibT_eX]

[DOI]

Thomas M. Langley

Adv. Appl. Math., 2006

2005

Statistics on wreath products, perfect matchings, and signed words.

[BibT_eX]

[DOI]

James Haglund

Nicholas A. Loehr

Eur. J. Comb., 2005

Logic programming with infinite sets.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 2005

PTIME Queries Revisited.

[BibT_eX]

[DOI]

Victor Vianu

Proceedings of the Database Theory, 2005

Set Based Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Nonmonotonic Reasoning, 2005

Normal Form Theorem for Logic Programs with Cardinality Constraints.

[BibT_eX]

[DOI]

Proceedings of the Nonmonotonic Reasoning, 2005

The Complexity of Inductive Definability.

[BibT_eX]

[DOI]

Proceedings of the New Computational Paradigms, 2005

2004

Index sets for computable differential equations.

[BibT_eX]

[DOI]

Math. Log. Q., 2004

A Class Of Graphs Which Has Efficient Ranking And Unranking Algorithms For Spanning Trees And Forests.

[BibT_eX]

[DOI]

S. G. Williamson

Int. J. Found. Comput. Sci., 2004

Cycles and perfect matchings.

[BibT_eX]

[DOI]

James Haglund

Discret. Math., 2004

Rook Theory, Generalized Stirling Numbers and (p, q)-Analogues.

[BibT_eX]

[DOI]

Michelle L. Wachs

Electron. J. Comb., 2004

A lambda-ring Frobenius Characteristic for G wreath Sn.

[BibT_eX]

[DOI]

Anthony Mendes

Jennifer Wagner

Electron. J. Comb., 2004

Conjectured Combinatorial Models for the Hilbert Series of Generalized Diagonal Harmonics Modules.

[BibT_eX]

[DOI]

Nicholas A. Loehr

Electron. J. Comb., 2004

The Plethysm sλ[sμ] at Hook and Near-Hook Shapes.

[BibT_eX]

[DOI]

Thomas M. Langley

Electron. J. Comb., 2004

Locally Determined Logic Programs and Recursive Stable Models.

[BibT_eX]

[DOI]

Amy Vanderbilt

Ann. Math. Artif. Intell., 2004

Finding stable models via quantum computation.

[BibT_eX]

[DOI]

David A. Meyer

James Pommersheim

Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Answer set programming with default logic.

[BibT_eX]

[DOI]

Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Set Constraints in Logic Programming.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Using Logic Programs to Reason about Infinite Sets.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2004

2003

On the expressibility of stable logic programming.

[BibT_eX]

[DOI]

Theory Pract. Log. Program., 2003

Index sets for omega-languages.

[BibT_eX]

[DOI]

Math. Log. Q., 2003

A p, q-analogue of a Formula of Frobenius.

[BibT_eX]

[DOI]

Karen S. Briggs

Electron. J. Comb., 2003

Universal Languages and the Power of Diagonalization.

[BibT_eX]

[DOI]

Russell Impagliazzo

Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002

Effectively closed sets and graphs of computable real functions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Spanning Trees and Function Classes.

[BibT_eX]

[DOI]

S. G. Williamson

Electron. J. Comb., 2002

On logic programs with cardinality constraints.

[BibT_eX]

Proceedings of the 9th International Workshop on Non-Monotonic Reasoning (NMR 2002), 2002

2001

Rook Theory for Perfect Matchings.

[BibT_eX]

[DOI]

James Haglund

Adv. Appl. Math., 2001

On the Foundations of Answer Set Programming.

[BibT_eX]

[DOI]

Proceedings of the Answer Set Programming, 2001

2000

Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels.

[BibT_eX]

[DOI]

Amy Vanderbilt

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2000

1999

Index Sets in Computable Analysis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Large-Scale Regularities of Lattice Embeddings of Posets.

[BibT_eX]

[DOI]

S. Gill Williamson

Order, 1999

Logic Programs, Well-Orderings, and Forward Chaining.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1999

Locally Determined Logic Programs.

[BibT_eX]

[DOI]

Amy Vanderbilt

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

1998

Complexity and Categoricity.

[BibT_eX]

[DOI]

Inf. Comput., 1998

Hook-Schur Functions Analogues of Littlewood's Identities and their Bijective Proofs.

[BibT_eX]

[DOI]

Mei Yang

Eur. J. Comb., 1998

A simple proof of the Littlewood-Richardson rule and applications.

[BibT_eX]

[DOI]

Mark Shimozono

Discret. Math., 1998

Formulas for the expansion of the plethysms s2[S(a, b)] and S2[S(nk)].

[BibT_eX]

[DOI]

Luisa Carini

Discret. Math., 1998

Index Sets for Pi01 Classes.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Preface.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

Feasible Graphs with Standard Universe.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

1997

Annotated Nonmonotonic Rule Systems.

[BibT_eX]

[DOI]

V. S. Subrahmanian

Theor. Comput. Sci., 1997

Complexity of Recursive Normal Default Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 1997

Quasi-Simple Relations in Copies of a Given Recursive Structure.

[BibT_eX]

[DOI]

Christopher J. Ash

Julia F. Knight

Ann. Pure Appl. Log., 1997

Nonmonotonic rule systems with recursive sets of restraints.

[BibT_eX]

[DOI]

Arch. Math. Log., 1997

Non-Monotonic Reasoning with Quantified Boolean Constraints.

[BibT_eX]

[DOI]

Ch. Pollet

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Basic Forward Chaining Construction for Logic Programs.

[BibT_eX]

[DOI]

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

Hybrid Dynamic Programming.

[BibT_eX]

[DOI]

Proceedings of the Hybrid and Real-Time Systems, 1997

Scalble Data and Sensor Fusion via Multiple Agent Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems V, 1997

1996

Combinatorics of theq-Basis of Symmetric Functions.

[BibT_eX]

[DOI]

Arun Ram

Tamsen Whitehead

J. Comb. Theory, Ser. A, 1996

The combinatorics of transition matrices between the bases of the symmetric functions and the Bn analogues.

[BibT_eX]

[DOI]

Desiree A. Beck

Tamsen Whitehead

Discret. Math., 1996

McNaughton Games and Extracting Strategies for Concurrent Programs.

[BibT_eX]

[DOI]

Alexander Yakhnis

Ann. Pure Appl. Log., 1996

On the Lattices of NP-Subspaces of a Polynomial Time Vector Space over a Finite Field.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1996

Nonmonotonic Rule Systems: Foward Chaining, Constraints, and Complexity (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

On the Complexity of Abduction.

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1996

Hybrid System Games: Extraction of Control Automata with Small Topologies.

[BibT_eX]

[DOI]

Alexander Yakhnis

Proceedings of the Hybrid Systems IV, 1996

Agent Based Velocity Control of Highway Systems.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems IV, 1996

1995

Viability in Hybrid Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1995

Feasible Graphs and Colorings.

[BibT_eX]

[DOI]

Math. Log. Q., 1995

A Combinatorial Proof of the Equivalence of the Classical and Combinatorial Definitions of Schur Function.

[BibT_eX]

Joaquin O. Carbonara

Andrius Kulikauskas

J. Comb. Theory, Ser. A, 1995

Permutation Enumeration of the Symmetric Group and the Combinatorics of Symmetric Functions.

[BibT_eX]

Desiree A. Beck

J. Comb. Theory, Ser. A, 1995

Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning

[BibT_eX]

[DOI]

Proceedings of the Proceedings, 1995

Hybrid Systems: Chattering Approximation to Relaxed Controls.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems III: Verification and Control, 1995

1994

Proofs, programs, and run times.

[BibT_eX]

[DOI]

John N. Crossley

Methods Log. Comput. Sci., 1994

The Stable Models of a Predicate Logic Program.

[BibT_eX]

J. Log. Program., 1994

A Context for Belief Revision: Forward Chaining - Normal Nonmonotonic Rule Systems.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1994

On Speedable and Levelable Vector Spaces.

[BibT_eX]

[DOI]

Frank A. Bäuerle

Ann. Pure Appl. Log., 1994

On Logical Constraints in Logic Programming.

[BibT_eX]

Proceedings of the ILPS 1994, 1994

Feasibly Categorial Models.

[BibT_eX]

[DOI]

Proceedings of the Logical and Computational Complexity. Selected Papers. Logic and Computational Complexity, 1994

Controllers as Fixed Points of Set-Valued Operators.

[BibT_eX]

[DOI]

Alexander Yakhnis

Proceedings of the Hybrid Systems II, 1994

Hybrid Systems as Finsler Manifolds: Finite State Control as Approximation to Connections.

[BibT_eX]

[DOI]

Proceedings of the Hybrid Systems II, 1994

1992

Formulas for the expansion of the Kronecker products S(m, n) * S(1p-r, r) and S(1k2l) * S(1p-r, r).

[BibT_eX]

[DOI]

Discret. Math., 1992

How Complicated is the Set of Stable Models of a Recursive Logic Program?

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1992

Cancellation Laws for Polynomial-Time p-Isolated Sets.

[BibT_eX]

[DOI]

John N. Crossley

Ann. Pure Appl. Log., 1992

Polynomial-Time Abelian Groups.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1992

A Theory of Nonmonotonic Rule Systems II.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1992

Rule Systems and Well-Orderings.

[BibT_eX]

Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

1991

Special Rim Hook Tabloids and Some New Multiplicity-Free S-Series.

[BibT_eX]

[DOI]

Mei Yang

SIAM J. Discret. Math., 1991

Pi01-Classes and Rado's Selection Principle.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

Andrew E. M. Lewis

J. Symb. Log., 1991

Brick tabloids and the connection matrices between bases of symmetric functions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Polynomial-Time versus Recursive Models.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1991

1990

The monomial symmetric functions and the Frobenius map.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1990

A Theory of Nonmonotonic Rule Systems I.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1990

A Theory of Nonmonotonic Rule Systems

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989

Complexity-Theoretic Algebra II: Boolean Algebras.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1989

Classification of Degree Classes Associated with r.e. Subspaces.

[BibT_eX]

[DOI]

Rodney G. Downey

Ann. Pure Appl. Log., 1989

Polynomially Grade Logic I: A Graded Version of System T

[BibT_eX]

[DOI]

Andre Scedrov

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

1987

Automorphisms and Recursive Structures.

[BibT_eX]

[DOI]

Rodney G. Downey

Math. Log. Q., 1987

Permutation statistics and (k, l)-hook Schur functions.

[BibT_eX]

[DOI]

Discret. Math., 1987

Recursively rigid Boolean algebras.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1987

The undecidability of the lattice of R.E. closed subsets of an effective topological space.

[BibT_eX]

[DOI]

Sheryl Silibovsky Brady

Ann. Pure Appl. Log., 1987

Complexity theoretic algebra I - vector spaces over finite fields.

[BibT_eX]

[DOI]

Proceedings of the Second Annual Conference on Structure in Complexity Theory, 1987

1986

Q-counting rook configurations and a formula of frobenius.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1986

Bijections for Cayley trees, spanning trees, and their q-analogues.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1986

Graph colorings and recursively bounded Π10-classes.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1986

Generic objects in recursion theory II: Operations on recursive approximation spaces.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1986

1985

Shuffles of permutations and the Kronecker product.

[BibT_eX]

[DOI]

Graphs Comb., 1985

A Combinatorial View of Andrews' Proof of the L-M-W Conjectures.

[BibT_eX]

[DOI]

Eur. J. Comb., 1985

1984

Effectively Nowhere Simple Sets.

[BibT_eX]

[DOI]

D. Miller

J. Symb. Log., 1984

The Universal Splitting Property. II.

[BibT_eX]

[DOI]

Manuel Lerman

J. Symb. Log., 1984

The Universal Complementation Property.

[BibT_eX]

[DOI]

Rodney G. Downey

J. Symb. Log., 1984

Multiplying Schur functions.

[BibT_eX]

[DOI]

Roger Whitney

J. Algorithms, 1984

1983

Indiscernibles and Decidable Models.

[BibT_eX]

[DOI]

Henry A. Kierstead

J. Symb. Log., 1983

Degrees of Recursively Enumerable Topological Spaces.

[BibT_eX]

[DOI]

Iraj Kalantari

J. Symb. Log., 1983

A Bijective Proof of the Hook Formula for the Number of Column Strict Tableaux with Bounded Entries.

[BibT_eX]

[DOI]

Roger Whitney

Eur. J. Comb., 1983

A Note on a Recursion for the Number of Derangements.

[BibT_eX]

[DOI]

Eur. J. Comb., 1983

1982

Bijective Proofs of Some Classical Partition Identities.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1982

1981

Recursive Boolean Algebras with Recursive Atoms.

[BibT_eX]

[DOI]

J. Symb. Log., 1981

Recursive Isomorphism Types of Recursive Boolean Algebras.

[BibT_eX]

[DOI]

J. Symb. Log., 1981

Partial Orderings of Fixed Finite Dimension: Model Companions and Density.

[BibT_eX]

[DOI]

Alfred B. Manaster

J. Symb. Log., 1981

1980

CO-Simple Higher-Order Indecomposable Isols.

[BibT_eX]

[DOI]

Alfred B. Manaster

Math. Log. Q., 1980

Recursion Theory on Orderings. II.

[BibT_eX]

[DOI]

J. Symb. Log., 1980

On R.E. and CO-R.E. Vector Spaces with Nonextendible Bases.

[BibT_eX]

[DOI]

J. Symb. Log., 1980

A Combinatorial Interpretation of q-Derangement and q-Laguerre Numbers.

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

1979

R-Maximal Boolean Algebras.

[BibT_eX]

[DOI]

J. Symb. Log., 1979

Recursion Theory on Orderings. I. A Model Theoretic Setting.

[BibT_eX]

[DOI]

George Metakides

J. Symb. Log., 1979

1978

A r-Maximal Vector Space not contained in any Maximal Vector Space.

[BibT_eX]

[DOI]

J. Symb. Log., 1978

1977

Maximal and Cohesive Vector Spaces.

[BibT_eX]

[DOI]

J. Symb. Log., 1977

1976

Co-Hypersimple Structures.

[BibT_eX]

[DOI]